perm filename MSG.MSG[JNK,JMC] blob
sn#885253 filedate 1990-06-17 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00195 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00030 00002
C00031 00003 ∂27-Mar-90 1600 @Sunburn.Stanford.EDU:reis@cis.Stanford.EDU Construction Automation and Robotics tilte of Next High Noon Talk
C00034 00004 ∂27-Mar-90 1616 LOGMTC-mailer Weds, 4:30pm, program synthesis talk reminder, sri ej228
C00036 00005 ∂27-Mar-90 1616 LOGMTC-mailer Weds, 4:30pm, program synthesis talk reminder, sri ej228
C00038 00006 ∂27-Mar-90 1623 LOGMTC-mailer correction to reminder
C00040 00007 ∂27-Mar-90 1623 LOGMTC-mailer correction to reminder
C00042 00008 ∂28-Mar-90 1050 @Sunburn.Stanford.EDU:prior@Hudson.Stanford.EDU Methane
C00044 00009 ∂28-Mar-90 1123 lilian@mojave.Stanford.EDU test
C00046 00010 ∂28-Mar-90 1137 lilian@mojave.Stanford.EDU test
C00047 00011 ∂28-Mar-90 1219 keyes@sierra.Stanford.EDU Position papers
C00049 00012 ∂28-Mar-90 1518 ingrid@russell.Stanford.EDU CSLI Calendar, 29 March, vol. 5:21
C00053 00013 ∂29-Mar-90 0944 chandler@Sunburn.Stanford.EDU Faculty Meeting
C00055 00014 ∂29-Mar-90 1021 LOGMTC-mailer MSRI Seminar Announcements, April 2-6
C00059 00015 ∂29-Mar-90 1209 LOGMTC-mailer Reminder: Vitanyi talks today and tomorrow
C00061 00016 ∂29-Mar-90 1339 littell@Sunburn.Stanford.EDU Summer RA list
C00064 00017 ∂29-Mar-90 1507 LOGMTC-mailer Seminar in Logic and Foundations of Mathematics
C00066 00018 ∂29-Mar-90 1530 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 3 April, 7:30 p.m.
C00071 00019 ∂29-Mar-90 1551 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Reminder: Vitanyi talks today and tomorrow
C00073 00020 ∂30-Mar-90 0831 chandler@Sunburn.Stanford.EDU Pat....
C00074 00021 ∂30-Mar-90 1018 chandler@Sunburn.Stanford.EDU Faculty Lunches
C00076 00022 ∂02-Apr-90 0841 chandler@Sunburn.Stanford.EDU Pat Simmons.....
C00078 00023 ∂02-Apr-90 0901 chandler@Sunburn.Stanford.EDU April 3 General Faculty Meeting Agenda
C00081 00024 ∂02-Apr-90 1002 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU A talk by Levin
C00085 00025 ∂02-Apr-90 1403 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Reminder, Complex Systems Seminar
C00088 00026 ∂02-Apr-90 2306 @Neon.Stanford.EDU:axwang@Theory.Stanford.EDU Special AFLB on Wednesday, April 4
C00092 00027 ∂02-Apr-90 2339 @Sunburn.Stanford.EDU:clemm@Neon.Stanford.EDU
C00094 00028 ∂03-Apr-90 0815 chandler@Sunburn.Stanford.EDU Publications
C00096 00029 ∂04-Apr-90 1206 gilberts@Sunburn.Stanford.EDU MJH 2nd Floor Hall
C00098 00030 ∂04-Apr-90 1313 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU LICS '90
C00124 00031 ∂04-Apr-90 1449 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Complex system Seminar now
C00125 00032 ∂04-Apr-90 1623 LOGMTC-mailer MSRI Seminar Announcements, April 9-13
C00129 00033 ∂04-Apr-90 1649 ingrid@russell.Stanford.EDU CSLI Calendar, 5 April, vol. 5:22
C00148 00034 ∂04-Apr-90 1653 LOGMTC-mailer Seminar in Logic and Foundations of Mathematics
C00150 00035 ∂05-Apr-90 0912 dietrich@sierra.Stanford.EDU Lost mail
C00151 00036 ∂05-Apr-90 1522 ingrid@russell.Stanford.EDU CSLI events on 4/6 and 4/9
C00155 00037 ∂05-Apr-90 1630 gilberts@Sunburn.Stanford.EDU MJH Closing at 4:15 Today
C00156 00038 ∂05-Apr-90 2338 grundy@csli.Stanford.EDU Symbolic Systems Forum
C00161 00039 ∂06-Apr-90 0904 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
C00166 00040 ∂06-Apr-90 0905 chandler@Sunburn.Stanford.EDU Next Tuesday's Faculty Lunch
C00168 00041 ∂06-Apr-90 1016 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
C00173 00042 ∂06-Apr-90 1038 LOGMTC-mailer Abstract for Uspensky talk
C00176 00043 ∂06-Apr-90 1042 grundy@csli.Stanford.EDU Symbolic Systems Forum correction
C00178 00044 ∂06-Apr-90 1412 chandler@Sunburn.Stanford.EDU Publication
C00180 00045 ∂06-Apr-90 1504 grundy@csli.Stanford.EDU Symbolic Systems Forum Spring Schedule
C00184 00046 ∂06-Apr-90 1746 ingrid@russell.Stanford.EDU IAP Corporate Advisory Board Meeting, 10/11 April 1990
C00187 00047 ∂06-Apr-90 1806 LOGMTC-mailer Talk by Rob van Glabbeek
C00200 00048 ∂08-Apr-90 1952 vivluo@Sunburn.Stanford.EDU advisor/advisee guidelines
C00202 00049 ∂08-Apr-90 2006 vivluo@Sunburn.Stanford.EDU Majors Event 4/18
C00204 00050 ∂09-Apr-90 0753 chandler@Sunburn.Stanford.EDU CSD 25th Anniversary
C00212 00051 ∂09-Apr-90 0825 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
C00214 00052 ∂09-Apr-90 1325 LOGMTC-mailer van Glabbeek student meeting
C00216 00053 ∂09-Apr-90 1453 chandler@Sunburn.Stanford.EDU [Gio Wiederhold <gio@sumex-aim.Stanford.EDU> : Faculty lunch topic
C00227 00054 ∂09-Apr-90 1456 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
C00229 00055 ∂09-Apr-90 1501 @Neon.Stanford.EDU:axwang@Theory.Stanford.EDU AFLB this week
C00232 00056 ∂09-Apr-90 2328 LOGMTC-mailer test message
C00234 00057 ∂10-Apr-90 0840 chandler@Sunburn.Stanford.EDU Women in Computer Science
C00236 00058 ∂10-Apr-90 0857 littell@Sunburn.Stanford.EDU Fellowship supplement
C00238 00059 ∂10-Apr-90 0903 chandler@Sunburn.Stanford.EDU I have received....
C00240 00060 ∂10-Apr-90 0936 ZM
C00247 00061 ∂10-Apr-90 0937 ZM
C00259 00062 ∂10-Apr-90 0938 ZM
C00270 00063 ∂10-Apr-90 1220 saraswat@cascade.Stanford.EDU EE 310 Seminar
C00272 00064 ∂10-Apr-90 1322 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Publication
C00274 00065 ∂10-Apr-90 1326 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU I have received....
C00276 00066 ∂10-Apr-90 1649 ingrid@russell.Stanford.EDU CSLI Colloquium on 4/12 - change of location
C00278 00067 ∂10-Apr-90 1950 vivluo@Sunburn.Stanford.EDU Please mark your calendars
C00280 00068 ∂10-Apr-90 2332 grundy@csli.Stanford.EDU Final Symbolic Systems Forum Schedule
C00285 00069 ∂11-Apr-90 0905 @Sunburn.Stanford.EDU:ejm@shasta.Stanford.EDU Re: Publication
C00287 00070 ∂11-Apr-90 0906 @Sunburn.Stanford.EDU:ejm@shasta.Stanford.EDU Re: I have received....
C00289 00071 ∂11-Apr-90 1122 LOGMTC-mailer Seminar in Logic and Foundations
C00291 00072 ∂11-Apr-90 1604 @Sunburn.Stanford.EDU:gio@sumex-aim.stanford.edu Engineer's degree
C00296 00073 ∂11-Apr-90 1628 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Dinner with Rob van Glabbeek
C00300 00074 ∂11-Apr-90 1628 LOGMTC-mailer Van Glabeek talks--reminder
C00304 00075 ∂11-Apr-90 1631 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Van Glabeek talks--reminder
C00308 00076 ∂11-Apr-90 1747 ingrid@russell.Stanford.EDU CSLI Calendar, 12 April, vol. 5:23
C00331 00077 ∂11-Apr-90 2007 @Sunburn.Stanford.EDU:shoham@Hudson.Stanford.EDU Visiting professor
C00333 00078 ∂12-Apr-90 1051 chandler@Sunburn.Stanford.EDU NOTICE
C00336 00079 ∂12-Apr-90 1217 LOGMTC-mailer MSRI Seminar Announcements, April 16-20
C00339 00080 ∂12-Apr-90 1527 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU commencement
C00341 00081 ∂12-Apr-90 1559 helen@russell.Stanford.EDU majors event
C00344 00082 ∂13-Apr-90 0913 chandler@Sunburn.Stanford.EDU Faculty Lunch
C00346 00083 ∂13-Apr-90 1515 @Sunburn.Stanford.EDU:tah@linz.Stanford.EDU Forsythe Award
C00349 00084 ∂13-Apr-90 1703 turner@sierra.Stanford.EDU INFORMATIONAL MEETING
C00351 00085 ∂13-Apr-90 2000 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SWAT'90
C00354 00086 ∂13-Apr-90 2000 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU TCS Olympiad
C00359 00087 ∂13-Apr-90 2112 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU 1990 ACM SPAA Program and Registration
C00397 00088 ∂13-Apr-90 2158 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Dimacs Workshop on Practical Issues in Geometry
C00403 00089 ∂14-Apr-90 0953 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU 1990/91 Comp Exam
C00406 00090 ∂14-Apr-90 1003 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Congressional Budget and grant money
C00410 00091 ∂14-Apr-90 1357 LOGMTC-mailer [pratt@cs.Stanford.EDU : Talk by Rob van Glabbeek ]
C00413 00092 ∂14-Apr-90 1402 LOGMTC-mailer sorry and please
C00415 00093 ∂16-Apr-90 1023 sweeney@cis.Stanford.EDU EE 310 to be held in AEL 109 this week
C00418 00094 ∂16-Apr-90 1330 @Sunburn.Stanford.EDU:tcr@sumex-aim.stanford.edu Campus Budget Cut Actions
C00424 00095 ∂16-Apr-90 1357 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGACT News -- deadline reminder
C00427 00096 ∂16-Apr-90 1402 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Second Call for Papers
C00436 00097 ∂16-Apr-90 1718 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Bell Fellowship announcement
C00438 00098 ∂16-Apr-90 1838 grossman@Sunburn.Stanford.EDU [Cindy_Larson@NeXT.COM: NeXT machine theft]
C00441 00099 ∂17-Apr-90 0901 INAN@STAR5.STANFORD.EDU Electromagnetics curriculum --
C00444 00100 ∂17-Apr-90 0924 helen@russell.Stanford.EDU internships
C00446 00101 ∂17-Apr-90 1012 grundy@csli.Stanford.EDU Symbolic Systems Forum April 19
C00451 00102 ∂17-Apr-90 1055 grundy@csli.Stanford.EDU Clarification on Symbolic Systems Forum
C00453 00103 ∂17-Apr-90 1150 mrg@Sunburn.Stanford.EDU phd evaluation
C00469 00104 ∂17-Apr-90 2118 LOGMTC-mailer Seminar in Logic and Foundations
C00471 00105 ∂17-Apr-90 2125 LOGMTC-mailer Seminar in Logic and Foundations
C00473 00106 ∂17-Apr-90 2146 axwang@Theory.Stanford.EDU Problem Session
C00475 00107 ∂18-Apr-90 0950 LOGMTC-mailer MSRI Seminar Announcements, April 23-27
C00479 00108 ∂18-Apr-90 1002 chandler@Sunburn.Stanford.EDU 1990 Commencement Marshals
C00481 00109 ∂18-Apr-90 1020 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Second International School for Computer Science Researchers
C00487 00110 ∂18-Apr-90 1031 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU University of Paderborn -- List of talks
C00493 00111 ∂18-Apr-90 1033 dietrich@sierra.Stanford.EDU Quarterly Reminder - Research Offsets
C00495 00112 ∂18-Apr-90 1311 chandler@Sunburn.Stanford.EDU ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : 1990
C00498 00113 ∂18-Apr-90 1323 jones@Sunburn.Stanford.EDU Virtual Reality
C00500 00114 ∂18-Apr-90 1400 chandler@Sunburn.Stanford.EDU PLEASE RSVP!!!!!!
C00505 00115 ∂18-Apr-90 1551 LOGMTC-mailer seminar abstract
C00507 00116 ∂18-Apr-90 1558 LOGMTC-mailer
C00510 00117 ∂18-Apr-90 1709 ingrid@russell.Stanford.EDU CSLI Calendar, 19 April, vol 5:24
C00524 00118 ∂19-Apr-90 0820 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU New Journal on Computational Geometry & Applications
C00531 00119 ∂19-Apr-90 1154 @Theory.Stanford.EDU:sherry@Neon.Stanford.EDU Discrete Math Conference
C00533 00120 ∂20-Apr-90 0926 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Eric Roberts
C00535 00121 ∂20-Apr-90 0928 chandler@Sunburn.Stanford.EDU Faculty Lunch
C00537 00122 ∂20-Apr-90 0958 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU draft agenda
C00543 00123 ∂20-Apr-90 1115 chandler@Sunburn.Stanford.EDU Second Senate Meeting on the Professoriate Information
C00545 00124 ∂20-Apr-90 1228 LOGMTC-mailer Seminar abstract
C00548 00125 ∂20-Apr-90 1615 LOGMTC-mailer Seminar in Logic and Foundations
C00550 00126 ∂21-Apr-90 1556 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU renewal of courtesy and consulting faculty
C00555 00127 ∂21-Apr-90 1831 grundy@csli.Stanford.EDU Symbolic Systems Forum
C00559 00128 ∂22-Apr-90 0825 @Sunburn.Stanford.EDU:gio@sumex-aim.stanford.edu Re: renewal of courtesy and consulting faculty
C00563 00129 ∂23-Apr-90 0812 chandler@Sunburn.Stanford.EDU CSD-s 25th Anniversary
C00571 00130 ∂23-Apr-90 0846 chandler@Sunburn.Stanford.EDU May 1 Faculty Meeting
C00572 00131 ∂23-Apr-90 0925 @Sunburn.Stanford.EDU:tcr@sumex-aim.stanford.edu Possible Affirmative Action Opportunity
C00577 00132 ∂23-Apr-90 1103 LOGMTC-mailer Raymond Smullyan lecture
C00579 00133 ∂23-Apr-90 1109 LOGMTC-mailer Matijasevich lectures
C00581 00134 ∂23-Apr-90 1541 aileen@Sunburn.Stanford.EDU louis lerman
C00582 00135 ∂23-Apr-90 2307 axwang@Theory.Stanford.EDU AFLB on Thursday
C00586 00136 ∂24-Apr-90 0133 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM derivatives of a quotient
C00593 00137 ∂24-Apr-90 0856 aileen@Sunburn.Stanford.EDU express mail
C00594 00138 ∂24-Apr-90 0949 reis@cis.Stanford.EDU SURF student available
C00597 00139 ∂24-Apr-90 1018 weening@Gang-of-Four.Stanford.EDU Workshop on Parallel Lisp/Prolog
C00603 00140 ∂24-Apr-90 1113 vivluo@Sunburn.Stanford.EDU Undergraduate CS Lunch Social
C00605 00141 ∂24-Apr-90 1347 sweeney@cis.Stanford.EDU TODAY EE 310 SEMINAR - ON: REACTOR MODELING
C00607 00142 ∂25-Apr-90 0754 der@beren.stanford.edu internships
C00609 00143 ∂25-Apr-90 0921 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for Papers
C00616 00144 ∂25-Apr-90 1037 LOGMTC-mailer MSRI Seminar Announcements, Apr 30 - May 4
C00619 00145 ∂25-Apr-90 1056 @Sunburn.Stanford.EDU:winograd@loire.stanford.edu NSF CISE grant
C00622 00146 ∂25-Apr-90 1138 chandler@Sunburn.Stanford.EDU CSD Retreat
C00624 00147 ∂25-Apr-90 1407 stager@Sunburn.Stanford.EDU Preliminary Class Lists
C00626 00148 ∂25-Apr-90 1613 ingrid@russell.Stanford.EDU CSLI Calendar, 26 April 1990, vol. 5:25
C00647 00149 ∂26-Apr-90 0818 pollock@Sunburn.Stanford.EDU 1990/91 Sabbatical Leave/Leave w/o Salary/Research Offset plans
C00649 00150 ∂26-Apr-90 0902 LOGMTC-mailer new address
C00651 00151 ∂26-Apr-90 1132 LOGMTC-mailer please remove me from this list
C00652 00152 ∂26-Apr-90 1602 @Sunburn.Stanford.EDU:pratt@sydney.stanford.edu Marc Levoy--dinner
C00654 00153 ∂27-Apr-90 0806 chandler@Sunburn.Stanford.EDU Facutly Lunch
C00656 00154 ∂27-Apr-90 0830 LOGMTC-mailer administrative matters
C00658 00155 ∂27-Apr-90 1329 chandler@Sunburn.Stanford.EDU Exchange with the USSR
C00660 00156 ∂27-Apr-90 1351 chandler@Sunburn.Stanford.EDU Publication
C00662 00157 ∂27-Apr-90 1506 carlstea@sierra.Stanford.EDU Parking
C00667 00158 ∂27-Apr-90 1618 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU leadership course
C00671 00159 ∂27-Apr-90 1619 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU commencement
C00674 00160 ∂27-Apr-90 1658 carlstea@sierra.Stanford.EDU Parking typing error
C00675 00161 ∂27-Apr-90 1733 JMC@SAIL.Stanford.EDU re: Parking
C00677 00162 ∂27-Apr-90 1738 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU faculty meeting
C00679 00163 ∂27-Apr-90 1742 @Sunburn.Stanford.EDU:hayes@roo.parc.xerox.com leadership course
C00681 00164 ∂27-Apr-90 1744 grundy@csli.Stanford.EDU Symbolic Systems Forum, May 3
C00684 00165 ∂28-Apr-90 0603 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM binomial primep
C00687 00166 ∂30-Apr-90 1015 carlstea@sierra.Stanford.EDU Overwhelming response
C00690 00167 ∂30-Apr-90 1020 carlstea@sierra.Stanford.EDU Parking
C00692 00168 ∂30-Apr-90 1101 chandler@Sunburn.Stanford.EDU CSL Faculty Candidates' Papers
C00694 00169 ∂30-Apr-90 1331 chandler@Sunburn.Stanford.EDU More papers.....
C00695 00170 ∂30-Apr-90 1353 carlstea@sierra.Stanford.EDU [ judycla (Judith C. Clark: Parking ]
C00700 00171 ∂30-Apr-90 1710 carlstea@sierra.Stanford.EDU Directions to Parking Hearing
C00701 00172 ∂30-Apr-90 1714 jones@Sunburn.Stanford.EDU Mac Pluses available
C00703 00173 ∂30-Apr-90 1923 axwang@Theory.Stanford.EDU This week's talk
C00708 00174 ∂30-Apr-90 2342 LOGMTC-mailer Seminar in Logic and Foundations
C00711 00175 ∂01-May-90 1059 bergman@Sunburn.Stanford.EDU SPO Funding Newsletter
C00713 00176 ∂01-May-90 1127 sweeney@cis.Stanford.EDU EE 310 Seminar today
C00715 00177 ∂01-May-90 1156 vivluo@Sunburn.Stanford.EDU Reminder: Lunch Social!
C00717 00178 ∂01-May-90 1409 chandler@Sunburn.Stanford.EDU Re: Bulletin Boards and First Aid Kits
C00719 00179 ∂01-May-90 1433 @Sunburn.Stanford.EDU:MPS@SAIL.Stanford.EDU Bulletin Boards and First Aid Kits
C00721 00180 ∂01-May-90 1509 @Sunburn.Stanford.EDU:mps@Gang-of-Four.Stanford.EDU Bulletin Boards and First Aid Kits
C00723 00181 ∂01-May-90 1517 @Sunburn.Stanford.EDU:mps@Gang-of-Four.Stanford.EDU Floor Monitors
C00725 00182 ∂01-May-90 1535 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report column, April 25,
C00729 00183 ∂01-May-90 1657 @Sunburn.Stanford.EDU:RWF@SAIL.Stanford.EDU re: Bulletin Boards and First Aid Kits
C00731 00184 ∂01-May-90 1726 @Sunburn.Stanford.EDU:connelly@Neon.Stanford.EDU Bulletin Boards and First Aid Kits
C00733 00185 ∂02-May-90 0959 hemenway@Sunburn.Stanford.EDU Final Results
C00740 00186 ∂02-May-90 1050 chandler@Sunburn.Stanford.EDU CSD RETREAT INFORMATION
C00748 00187 ∂02-May-90 1238 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Summary of rejects
C00750 00188 ∂02-May-90 1331 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: Summary of rejects
C00752 00189 ∂02-May-90 1353 @Sunburn.Stanford.EDU:dill@hohum.Stanford.EDU recruitment
C00757 00190 ∂02-May-90 1355 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Summary of rejects
C00759 00191 ∂02-May-90 1424 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Summary of rejects
C00764 00192 ∂02-May-90 1433 @Sunburn.Stanford.EDU:jcm@Iswim.Stanford.EDU Re: Summary of rejects
C00766 00193 ∂02-May-90 1435 pratt@coraki.stanford.edu lunch tomorrow?
C00768 00194 ∂02-May-90 1459 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: recruitment
C00770 00195 ∂02-May-90 1602 ingrid@russell.Stanford.EDU CSLI Calendar, 3 May, vol 5:26
C00786 ENDMK
C⊗;
∂27-Mar-90 1600 @Sunburn.Stanford.EDU:reis@cis.Stanford.EDU Construction Automation and Robotics tilte of Next High Noon Talk
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Mar 90 15:59:54 PST
Received: from CIS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA29240; Tue, 27 Mar 90 15:49:50 -0800
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA10801; Tue, 27 Mar 90 15:48:34 PST
Resent-Message-Id: <9003272348.AA10801@cis.Stanford.EDU>
Date: Tue 27 Mar 90 15:46:38-PST
From: Rick Reis <REIS@cis.Stanford.EDU>
Subject: Construction Automation and Robotics tilte of Next High Noon Talk
To: reis@cis.Stanford.EDU
Message-Id: <VAX-MM(187)+TOPSLIB(118) 27-Mar-90 15:46:38.CIS.STANFORD.EDU>
Resent-Date: Tue 27 Mar 90 15:48:33-PST
Resent-From: Rick Reis <REIS@cis.Stanford.EDU>
Resent-To: faculty@CS.Stanford.EDU, phd@CS.Stanford.EDU
CONSTRUCTION AUTOMATION AND ROBOTICS
In what promises to be a truly exciting presentation, Boyd Paulson, the
Ohbayashi Professor of Engineering will present an overview of large scale
field construction (highways, urban skyscrapers, tunnels and dams) as a
potential application area for advanced automation and robotic technologies.
In this popular talk he will also focus on trend in research and development
in the U.S. and elsewhere and their relationship to civil engineering and
computer science research at Stanford.
The presentation is open to all members of the Stanford Community and will
be in Skillin Auditorium at noon on Friday, April 6.
Hope to see you there.
Rick Reis
-------
-------
∂27-Mar-90 1616 LOGMTC-mailer Weds, 4:30pm, program synthesis talk reminder, sri ej228
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 27 Mar 90 16:16:36 PST
Date: Tue 27 Mar 90 16:05:01-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: Weds, 4:30pm, program synthesis talk reminder, sri ej228
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@sail.stanford.edu,
colloq@cs.stanford.edu, ba-seminars@CSL.SRI.COM,
bboard@Warbucks.AI.SRI.COM, su-bboards@cs.stanford.edu
Message-ID: <638582701.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
Henson Graves
Lockheed Software Technology Center
Automatic Programming at Lockheed
AI Center Conference Room EJ228
Wednesday, 28 Sept., 4:30pm
Visitors please arrive early to sign in.
Guests from U.S. "designated" countries please
make prior arrangements to be admitted (call
Dori Arceo, 859-2641)
SRI is at 333 Ravenswood Avenue, Menlo Park.
The talk is in Building E.
We apologize for multiple copies of this reminder.
-------
∂27-Mar-90 1616 LOGMTC-mailer Weds, 4:30pm, program synthesis talk reminder, sri ej228
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 27 Mar 90 16:16:36 PST
Date: Tue 27 Mar 90 16:05:01-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: Weds, 4:30pm, program synthesis talk reminder, sri ej228
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@sail.stanford.edu,
colloq@cs.stanford.edu, ba-seminars@CSL.SRI.COM,
bboard@Warbucks.AI.SRI.COM, su-bboards@cs.stanford.edu
Message-ID: <638582701.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
Henson Graves
Lockheed Software Technology Center
Automatic Programming at Lockheed
AI Center Conference Room EJ228
Wednesday, 28 Sept., 4:30pm
Visitors please arrive early to sign in.
Guests from U.S. "designated" countries please
make prior arrangements to be admitted (call
Dori Arceo, 859-2641)
SRI is at 333 Ravenswood Avenue, Menlo Park.
The talk is in Building E.
We apologize for multiple copies of this reminder.
-------
∂27-Mar-90 1623 LOGMTC-mailer correction to reminder
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 27 Mar 90 16:22:38 PST
Date: Tue 27 Mar 90 16:12:28-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: correction to reminder
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@sail.stanford.edu,
col@Warbucks.AI.SRI.COM
cc: colloq@cs.stanford.edu, ba-seminars@CSL.SRI.COM,
bboard@Warbucks.AI.SRI.COM, su-bboards@cs.stanford.edu
Message-ID: <638583148.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
The reminder for the Henson Graves talk at SRI should read
"March 28" (tomorrow), not "September 28."
-------
∂27-Mar-90 1623 LOGMTC-mailer correction to reminder
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 27 Mar 90 16:22:38 PST
Date: Tue 27 Mar 90 16:12:28-PST
From: WALDINGER@Warbucks.AI.SRI.COM (Richard Waldinger)
Subject: correction to reminder
To: aic-staff@Warbucks.AI.SRI.COM, cslstaff@CSL.SRI.COM,
planlunch@Warbucks.AI.SRI.COM, logmtc@sail.stanford.edu,
col@Warbucks.AI.SRI.COM
cc: colloq@cs.stanford.edu, ba-seminars@CSL.SRI.COM,
bboard@Warbucks.AI.SRI.COM, su-bboards@cs.stanford.edu
Message-ID: <638583148.0.WALDINGER@WARBUCKS.AI.SRI.COM>
Mail-System-Version: <VAX-MM(229)+TOPSLIB(126)@WARBUCKS.AI.SRI.COM>
The reminder for the Henson Graves talk at SRI should read
"March 28" (tomorrow), not "September 28."
-------
∂28-Mar-90 1050 @Sunburn.Stanford.EDU:prior@Hudson.Stanford.EDU Methane
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Mar 90 10:50:15 PST
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18030; Wed, 28 Mar 90 10:49:44 -0800
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA19750; Wed, 28 Mar 90 10:47:42 -0800
Date: Wed, 28 Mar 1990 10:47:41 PST
From: John Prior <prior@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: tajnai@Hudson.Stanford.EDU, prior@Hudson.Stanford.EDU
Subject: Methane
Message-Id: <CMM.0.88.638650061.prior@Hudson.Stanford.EDU>
A researcher at one of our Computer Forum companies, R. R. Donnelley and
Sons, would like to know if anyone at Stanford is doing work related to the
manufacture of methane gas from newspaper slurry.
Any leads?
John Prior
Computer Forum
3-9689
∂28-Mar-90 1123 lilian@mojave.Stanford.EDU test
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Mar 90 11:23:46 PST
Received: from mojave.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 28 Mar 90 11:18:45 PST
Received: by mojave.Stanford.EDU (5.57/Ultrix2.4-C)
id AA24282; Wed, 28 Mar 90 11:17:42 PST
Date: Wed, 28 Mar 90 11:17:42 PST
From: lilian@mojave.stanford.edu (Lilian Betters)
Message-Id: <9003281917.AA24282@mojave.Stanford.EDU>
To: bert@kaos.Stanford.EDU, buneman@sierra.Stanford.EDU,
cottle@sierra.Stanford.EDU, ee-faculty@sierra.Stanford.EDU,
golub@patience.Stanford.EDU, harriet@star.Stanford.EDU,
isl-faculty@isl.Stanford.EDU, mike@sol-michael.Stanford.EDU,
milletti@isl.com, miraflor@sierra.Stanford.EDU,
moler@patience.Stanford.EDU, na.cem@forsythe.Stanford.EDU,
oliger@pride.Stanford.EDU, veinott@sierra.Stanford.EDU
Subject: test
test
∂28-Mar-90 1137 lilian@mojave.Stanford.EDU test
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Mar 90 11:37:30 PST
Received: from mojave.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Wed, 28 Mar 90 11:34:34 PST
Received: by mojave.Stanford.EDU (5.57/Ultrix2.4-C)
id AA24453; Wed, 28 Mar 90 11:33:52 PST
Message-Id: <9003281933.AA24453@mojave.Stanford.EDU>
To: ee370@mojave.Stanford.EDU
Cc: lilian@mojave.Stanford.EDU
Subject: test
Date: Wed, 28 Mar 90 11:33:49 PST
From: lilian@mojave.Stanford.EDU
This is a test; please ignore.
Thanks,
Lilian
∂28-Mar-90 1219 keyes@sierra.Stanford.EDU Position papers
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Mar 90 12:19:26 PST
Received: by sierra.Stanford.EDU (4.1/4.7); Wed, 28 Mar 90 12:16:15 PST
Date: Wed, 28 Mar 90 12:16:15 PST
From: keyes@sierra.Stanford.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.Stanford.EDU
Subject: Position papers
Message-Id: <CMM.0.88.638655374.keyes@>
Joe Goodman sent a memo to the faculty on 3/12 on "Future Appointment Plans",
soliciting position papers, and asking that they be submitted no later than
Monday, April 9. Since Joe is leaving for Japan on Friday, April 6, it
would be greatly appreciated if your position papers could be given to
him by Thursday, April 5, so he will have an opportunity to review them
on his trip.
Thank you.
Gloria
∂28-Mar-90 1518 ingrid@russell.Stanford.EDU CSLI Calendar, 29 March, vol. 5:21
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 Mar 90 15:17:55 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA07380; Wed, 28 Mar 90 14:49:56 PST
Date: Wed, 28 Mar 90 14:49:56 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003282249.AA07380@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 29 March, vol. 5:21
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
29 March 1990 Stanford Vol. 5, No. 21
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 5 APRIL 1990
12:00 noon TINLunch
Cordura 100 Variation Across a Population of American
English Speakers
Meg Withgott and Francine Chen
(withgott.pa@xerox.com)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Variation Across a Population of American English Speakers
Meg Withgott and Francine Chen
The observation that the patterning of speech sounds is sensitive to
context is central to the analysis of spoken language. Among the
contexts we have modeled computationally are suprasegmental
environments such as syllable stress and position in a suprasyllabic
unit called the foot. We investigated the relationship of such
contexts with sound patterns in a large collection of spoken American
English utterances. Given the controversial stature of such entities
in the speech and parts of the linguistic communities, our finding
that many of these factors are significant predictors of pronunciation
is of theoretical interest. At the same time, we find it enables us to
create better models for both speech recognition and synthesis.
____________
SEMINAR ON THOUGHT AND LANGUAGE
Julius Moravcsik
(julius@csli.stanford.edu)
Wednesdays, 6:00-8:00 p.m.
Cordura 104
Julius Moravcsik will hold a seminar on his recently published book
_Thought and Language_. The first meeting is on Wednesday, 4 April.
Abstract to be announced.
____________
∂29-Mar-90 0944 chandler@Sunburn.Stanford.EDU Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Mar 90 09:44:19 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08576; Thu, 29 Mar 90 09:45:30 -0800
Date: Thu, 29 Mar 1990 9:45:28 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Faculty Meeting
Message-Id: <CMM.0.88.638732728.chandler@Sunburn.Stanford.EDU>
Reminding you of next Tuesday's general faculty meeting, 4/3/90 at 2:30 in
MJH-146. Any last minute ideas for agenda items should be sent to me as soon
as possible.
∂29-Mar-90 1021 LOGMTC-mailer MSRI Seminar Announcements, April 2-6
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 29 Mar 90 10:21:38 PST
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA25638; Thu, 29 Mar 90 10:15:23 PST
Received: by msri.org (4.0/SMI-4.0)
id AA10757; Thu, 29 Mar 90 10:12:42 PST
Date: Thu, 29 Mar 90 10:12:42 PST
From: david@msri.org (David Mostardi)
Message-Id: <9003291812.AA10757@msri.org>
To: weekly@msri.org
Subject: MSRI Seminar Announcements, April 2-6
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Seminar Announcements for April 2 - 6, 1990
Monday, April 2
RECURSION THEORY 11:00 MSRI Lecture Hall
K. Ambos-Spies "Minimal Pairs For Polynomial-Time Degrees" I
MSRI-EVANS MONDAY LECTURE 4:15 60 Evans Hall
S. Friedman "Large Cardinals and Godel Incompleteness"
Tuesday, April 3
MODEL THEORY 12:30 MSRI Seminar Room
L. van den Dries "Cell Decomposition in Henselian Fields" II
NUMBER THEORY AND ALGORITHMS 2:15 MSRI Seminar Room
R. Schroeppel "Sum of Three Squares-- Walking the Sphere"
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
T. Goodwillie "Cyclotomic Trace Map" XI
SET THEORY 3:30 MSRI Lecture Hall
Qi Feng "Open Coloring Axiom and Universal Baire Property"
Wednesday, April 4
RECURSION THEORY 1:30 MSRI Lecture Hall
K. Ambos-Spies "Minimal Pairs For Polynomial-Time Degrees" II
MODEL THEORY 3:30 MSRI Seminar Room
A. Macintyre "p-Adic Exponentiation" II
Thursday, April 5
CROSS CULTURAL 11:00 MSRI Lecture Hall
A. Kechris "Descriptive Aspects of Borel Group Actions and Equivalence Relations"
CENTER FOR PURE & APPLIED MATHEMATICS LUNCH TALK 12:10 (Bring your lunch)
J. King "How to Think About Things Bigger Than Your Brain" 12:45 Faculty Club Conf. Rm
MODEL THEORY 1:00 MSRI Seminar Room
L. van den Dries "Cell Decomposition in Henselian Fields" III
INFORMAL CORE MODEL SEMINAR 2:30 MSRI Seminar Room
P. D. Welch "Fine Structure" III
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
T. Goodwillie "Cyclotomic Trace Map" XII
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
A. Casson "To Be Announced"
Friday, April 6,
AREA III SEMINAR 11:00 MSRI Seminar Room
A.K.M. Masood-ul-Alam "On some spherically synmetric solutions
of SU(2)-Yang-Mills-Einstein coupled equations."
Corrected copy as of: March 27, 1990
∂29-Mar-90 1209 LOGMTC-mailer Reminder: Vitanyi talks today and tomorrow
Received: from coraki.stanford.edu by SAIL.Stanford.EDU with TCP; 29 Mar 90 12:09:17 PST
Received: by coraki.stanford.edu (4.0/25-eef) id AA16171; Thu, 29 Mar 90 12:10:32 PST
Date: Thu, 29 Mar 90 12:10:32 PST
From: Vaughan Pratt <pratt@cs.stanford.edu>
Message-Id: <9003292010.AA16171@coraki.stanford.edu>
To: aflb-all@cs, logmtc@sail, paco@wolvesden
Subject: Reminder: Vitanyi talks today and tomorrow
A reminder that Paul Vitanyi of CWI and the University of Amsterdam
will give the following two talks on Kolmogoroff complexity today and
tomorrow. Both talks will be in Margaret Jacks Hall room 352.
Thursday, March 29, 4:15: Introduction to Kolmogorov Complexity
Friday, March 30, 10:00: Inductive Reasoning and Kolmogorov Complexity
∂29-Mar-90 1339 littell@Sunburn.Stanford.EDU Summer RA list
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Mar 90 13:38:50 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18734; Thu, 29 Mar 90 13:40:05 -0800
Date: Thu, 29 Mar 90 13:40:05 -0800
From: Angelina M. Littell <littell@Sunburn.Stanford.EDU>
Message-Id: <9003292140.AA18734@Sunburn.Stanford.EDU>
To: bigelow@cs.Stanford.EDU, cheriton@cs.Stanford.EDU, dill@cs.Stanford.EDU,
floyd@cs.Stanford.EDU, mrg@cs.Stanford.EDU, goldberg@cs.Stanford.EDU,
golub@cs.Stanford.EDU, guibas@cs.Stanford.EDU, gupta@cs.Stanford.EDU,
herriot@cs.Stanford.EDU, lam@cs.Stanford.EDU, zm@cs.Stanford.EDU,
mccarthy@cs.Stanford.EDU, jcm@cs.Stanford.EDU, nilsson@cs.Stanford.EDU,
oliger@cs.Stanford.EDU, pratt@cs.Stanford.EDU, ullman@cs.Stanford.EDU,
gio@cs.Stanford.EDU, winograd@cs.Stanford.EDU
Cc: littell@Sunburn.Stanford.EDU
Subject: Summer RA list
Please send me a list of students you plan to support during the
summer quarter, along with their source of support and percentage of
time. I need this information as soon as possible. The RA appointment
forms need to be processed in the Graduate Awards Office by April 27th
so that the students receive their bills with the correct tuition applied.
Thank you.
--Angie
∂29-Mar-90 1507 LOGMTC-mailer Seminar in Logic and Foundations of Mathematics
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Mar 90 15:07:51 PST
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA01395; Thu, 29 Mar 90 15:09:53 PST
Date: Thu, 29 Mar 1990 15:09:52 PST
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Seminar in Logic and Foundations of Mathematics
Message-Id: <CMM.0.88.638752192.sf@csli.stanford.edu>
The seminar, suspended since last year, will resume meeting this spring
as announced in the time schedule.
First Speaker: Dr. Sergei Artemov, Steklov Institute of Mathematics
Title: "Kolmogorov's logic of problems and a provability interpretation
of intuitionistic logic"
Time: Monday, April 2, 4:15-5:30
Place: Room 381-T, first floor, Math Corner, Stanford
S. Feferman
∂29-Mar-90 1530 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 3 April, 7:30 p.m.
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Mar 90 15:29:58 PST
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA15979; Thu, 29 Mar 90 14:51:06 PST
Date: Thu, 29 Mar 90 14:51:06 PST
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9003292251.AA15979@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Syntax Workshop, Tuesday, 3 April, 7:30 p.m.
SYNTAX WORKSHOP
Capturing the English Nominal Gerund: Two Apparently
Equivalent Phrase Structure Accounts
Geoff Pullum
University of California at Santa Cruz
Tuesday, 3 April, 7:30 p.m.
Cordura 100
The nominal gerund phrase (NGP), as in "GOING TO THE BEACH is fun" or
"They didn't approve of YOUR HAVING LEFT," poses some well-known
problems for syntactic theory. Numerous familiar diagnostics show
that it has the external syntax of a noun phrase, and some internal
syntax to match, but no overt signs of a noun head, and some signs of
the internal syntax of a VP. One thing that is not immediately clear,
therefore, is whether there is any analysis that respects
endocentricity (the principle that every constituent has a head, in
the sense X-bar theory attempts to explicate). Some analyses
postulate syntactically and semantically implausible empty noun nodes
to force compliance with X-bar theory, but interestingly these
analyses can all be shown to be incorrect under a wide range of
uncontroversial assumptions.
I know of two analyses of the NGP that preserve endocentricity. One
is due to Steven Abney, and assumes the DP hypothesis of Chomsky's
BARRIERS. It postulates a determiner that attaches to the head of its
VP complement. The other is due to me, and postulates NPs with VP
heads (which is a straightforward theoretical possibility in terms of
GKPS assumptions). What I have not been able to find is evidence that
one of these descriptions of the NGP is superior to the other. An
exhaustive survey of all the interesting explicanda leaves the two
accounts on a par, and the discovery of some new facts about NGPs
(such as that they can, contra Rosenbaum, sometimes be extraposed)
does not lead to the emergence of any crucial data that decides
between the competing analyses. The present talk, in workshop rather
than lecture style, explores the range of relevant data and lays out
the basis for the choice, in the hope that that the participants can
assist in finding new evidence or criteria.
************
The next workshop will be Tuesday, 17 April. Future dates and
speakers are:
17 Apr Fu Tan
1 May Joan Bresnan and Sam Mchombo
15 May Robert Van Valin
29 May Carol Neidle
∂29-Mar-90 1551 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Reminder: Vitanyi talks today and tomorrow
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 Mar 90 15:51:23 PST
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02947; Thu, 29 Mar 90 15:46:42 -0800
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14235; Thu, 29 Mar 90 12:10:53 -0800
Received: by coraki.stanford.edu (4.0/25-eef) id AA16171; Thu, 29 Mar 90 12:10:32 PST
Date: Thu, 29 Mar 90 12:10:32 PST
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9003292010.AA16171@coraki.stanford.edu>
To: aflb-all@cs.Stanford.EDU, logmtc@sail.Stanford.EDU,
paco@wolvesden.Stanford.EDU
Subject: Reminder: Vitanyi talks today and tomorrow
A reminder that Paul Vitanyi of CWI and the University of Amsterdam
will give the following two talks on Kolmogoroff complexity today and
tomorrow. Both talks will be in Margaret Jacks Hall room 352.
Thursday, March 29, 4:15: Introduction to Kolmogorov Complexity
Friday, March 30, 10:00: Inductive Reasoning and Kolmogorov Complexity
∂30-Mar-90 0831 chandler@Sunburn.Stanford.EDU Pat....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Mar 90 08:30:55 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA09216; Fri, 30 Mar 90 08:32:28 -0800
Date: Fri, 30 Mar 1990 8:32:28 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU, talcott@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Pat....
Message-Id: <CMM.0.88.638814748.chandler@Sunburn.Stanford.EDU>
called in this morning. She's not feeling well and will not be in today.
∂30-Mar-90 1018 chandler@Sunburn.Stanford.EDU Faculty Lunches
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Mar 90 10:18:39 PST
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14719; Fri, 30 Mar 90 10:18:06 -0800
Date: Fri, 30 Mar 1990 10:18:05 PST
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Faculty Lunches
Message-Id: <CMM.0.88.638821085.chandler@Sunburn.Stanford.EDU>
Just a reminder ... First faculty lunch of the Spring quarter will be next
Tuesday, 4/3....12:15 in MJH-146. No formal topic but Nils will discuss
plans for the CSD faculty retreat. See you all next Tuesday!
∂02-Apr-90 0841 chandler@Sunburn.Stanford.EDU Pat Simmons.....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Apr 90 08:41:01 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19593; Mon, 2 Apr 90 08:41:51 -0700
Date: Mon, 2 Apr 1990 8:41:50 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: jmc-lists@sail.Stanford.EDU, talcott@cs.Stanford.EDU
Cc: sloan@cs.Stanford.EDU, davis@cs.Stanford.EDU, gilbertson@cs.Stanford.EDU
Subject: Pat Simmons.....
Message-Id: <CMM.0.88.639070910.chandler@Sunburn.Stanford.EDU>
.....just called me. She said she still isn't feeling well and will not be
in today. She asked me to tell you, John, not to worry about your trip
plans. She said she will be in tomorrow and will take care of things.
∂02-Apr-90 0901 chandler@Sunburn.Stanford.EDU April 3 General Faculty Meeting Agenda
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Apr 90 09:00:57 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19993; Mon, 2 Apr 90 09:01:29 -0700
Date: Mon, 2 Apr 1990 9:01:28 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: April 3 General Faculty Meeting Agenda
Message-Id: <CMM.0.88.639072088.chandler@Sunburn.Stanford.EDU>
@center(@b[Agenda, General Faculty Meeting])
@center(April 3, 1990)
@center(2:30 p.m.)
@center(MJH 146)
@blankspace(2lines)
@begin(format)@tabclear()
@tabset(.5in, 1in)
I. Approval of degree candidates, Sharon Hemenway
II. Staff Reports
@\@\A. Computer Forum
@\@\@#@#Nils Nilsson
@\@\B. Department Finances
@\@\@#@#George Wheaton
@\@\D. Educational Affairs
@\@\@#@#Roy Jones
@\@\E. Computer Facilities
@\@\@#@#George Wheaton
III. Other Items
@\@\A. Information Sciences Building
@\@\@#@#Nils Nilsson
@\@\B. Associate Chair for Educational Affairs
@\@\@#@#George Wheaton
@\@\C. 1990/91 PhD Comp Exam
@\@\D. Format for On-Line Dissertations
@\@\@#@#John McCarthy
V. Other
@end(format)
∂02-Apr-90 1002 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU A talk by Levin
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Apr 90 10:01:49 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21318; Mon, 2 Apr 90 09:58:49 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA13993; Mon, 2 Apr 90 09:57:34 -0700
Date: Mon, 2 Apr 90 09:57:34 -0700
From: Andrew V. Goldberg <ango@Hudson.Stanford.EDU>
Message-Id: <9004021657.AA13993@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU, su.events@neon.Stanford.EDU
Subject: A talk by Levin
Professor Leonid Levin will be speaking on a special AFLB seminar at 11AM
on Wednesday, April 4, in MJH 252.
-------------------------------------------------------------------------------
Leonid Levin (Boston University)
Pseudo-Random Bits: Full Security at Last.
I will show tight relationship between two remarkable phenomena: pseudo-random
bits and one-way functions.
Function inverting is a challenging task. Consider F(x) which checks whether x
is an absolutely complete mathematical proof and outputs its length and the
last proven fact. F is trivial to compute, but inverting it amounts to finding
shortest proofs for any given theorem! Still, the problem (known as "P =? NP")
of actually proving that some functions are one-way (i.e. easy to compute while
hard to invert) remains open. Security of F is the time needed to notice that
some algorithm can successfully invert F with an observable frequency.
A reason for F being one-way may be in a particular simple predicate b(x) that
is determined by but hard to compute from F(x). Moreover, b(x) may even be
hard to guess with any noticeable correlation (then F must be one-way on most
inputs). Security of b is the time needed to notice the correlation. b(x) may
be determined by F(x) while appearing completely random. So, randomness and
determinism may be not so opposite as our scientific culture presumes.
Such (hypothetical) hidden bits play a significant role in foundations of
(pseudo)randomness, information, cryptography, and other areas. Blum, Micali
and Yao found hidden bits for functions of a special form (assuming there are
one-way ones among them). [Goldreich Levin, STOC-89] show that every one-way
function hides, with at most a polynomial security loss, almost all linear
predicates. We will see that no polynomial security loss actually occurs.
∂02-Apr-90 1403 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Reminder, Complex Systems Seminar
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 2 Apr 90 14:03:08 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Mon, 2 Apr 90 13:58:43-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Mon, 2 Apr 90 13:56:43 PDT
Date: Mon, 2 Apr 90 13:58 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Reminder, Complex Systems Seminar
To: Complex-Systems@Warbucks.AI.SRI.COM
Message-ID: <19900402205858.4.BERGMAN@HUXLEY.AI.SRI.COM>
Rationality and Learning in the Economy
W. Brian Arthur
Wednesday, April 4 1990, 1:30PM (note change of date)
Room EJ 228
W. Brian Arthur, a Morrison Profesor of Population Studies and
Economics at Stanford University, will talk about
the behavior of the economy as an evolving, complex system.
Last year Arthur directed a team of biologists, physicists and
economists at the Santa Fe Institute investigating this subject.
Address: SRI International
333 Ravenswood Ave.
Menlo Park, CA
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
-----------------------------------------------------------------------------------
Send submissions, questions, address maintenance and requests to present talks to
"complex-systems-request@AI.SRI.COM" or Bergman@AI.SRI.COM
- Aviv.
∂02-Apr-90 2306 @Neon.Stanford.EDU:axwang@Theory.Stanford.EDU Special AFLB on Wednesday, April 4
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Apr 90 23:06:35 PDT
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA29415; Mon, 2 Apr 90 23:05:19 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA08624; Mon, 2 Apr 90 23:01:09 -0700
Message-Id: <9004030601.AA08624@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: Special AFLB on Wednesday, April 4
Date: Mon, 02 Apr 90 23:01:06 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
Leonid Levin will speak at AFLB this Wednesday, April 4, in MJH 252,
at 11:00am (please note the time and day).
Leonid Levin (Boston University)
Pseudo-Random Bits: Full Security at Last.
I will show tight relationship between two remarkable phenomena: pseudo-random
bits and one-way functions.
Function inverting is a challenging task. Consider F(x) which checks whether x
is an absolutely complete mathematical proof and outputs its length and the
last proven fact. F is trivial to compute, but inverting it amounts to finding
shortest proofs for any given theorem! Still, the problem (known as "P =? NP")
of actually proving that some functions are one-way (i.e. easy to compute while
hard to invert) remains open. Security of F is the time needed to notice that
some algorithm can successfully invert F with an observable frequency.
A reason for F being one-way may be in a particular simple predicate b(x) that
is determined by but hard to compute from F(x). Moreover, b(x) may even be
hard to guess with any noticeable correlation (then F must be one-way on most
inputs). Security of b is the time needed to notice the correlation. b(x) may
be determined by F(x) while appearing completely random. So, randomness and
determinism may be not so opposite as our scientific culture presumes.
Such (hypothetical) hidden bits play a significant role in foundations of
(pseudo)randomness, information, cryptography, and other areas. Blum, Micali
and Yao found hidden bits for functions of a special form (assuming there are
one-way ones among them). [Goldreich Levin, STOC-89] show that every one-way
function hides, with at most a polynomial security loss, almost all linear
predicates. We will see that no polynomial security loss actually occurs.
∂02-Apr-90 2339 @Sunburn.Stanford.EDU:clemm@Neon.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Apr 90 23:39:46 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12222; Mon, 2 Apr 90 23:40:34 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA00797; Mon, 2 Apr 90 23:40:32 -0700
Date: Mon, 2 Apr 90 23:40:32 -0700
From: Alexander L Clemm <clemm@Neon.Stanford.EDU>
Message-Id: <9004030640.AA00797@Neon.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU
Dear Professor McCarthy!
I picked up my report card this morning and was a little surprised
to find that I received an A- in your course (CS323). I scored all
20 points in the homeworks and turned in a term paper (on which you
gave me an A-). I am not unhappy with my grade but had thought that
according to what you said in class about turning in a term paper that
my performance might even suffice for an A. There are no hard feelings,
basically I am only writing you in order to make sure that the grade
reported is correct.
Sincerely, Alexander
∂03-Apr-90 0815 chandler@Sunburn.Stanford.EDU Publications
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Apr 90 08:15:20 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15773; Tue, 3 Apr 90 08:15:19 -0700
Date: Tue, 3 Apr 1990 8:15:18 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Publications
Message-Id: <CMM.0.88.639155718.chandler@Sunburn.Stanford.EDU>
I have the following publications in my office. Let me know if you would
like to borrow them:
NSF Summary of Awards - Fiscal year 1988
NSF Summary of Awards - Fiscal year 1989
∂04-Apr-90 1206 gilberts@Sunburn.Stanford.EDU MJH 2nd Floor Hall
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Apr 90 12:06:27 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07936; Wed, 4 Apr 90 11:47:17 -0700
Date: Wed, 4 Apr 1990 11:47:17 PDT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Subject: MJH 2nd Floor Hall
Message-Id: <CMM.0.88.639254837.gilberts@Sunburn.Stanford.EDU>
CSD Folks:
The hall carpet in Bldg 460 will be sprayed with an insect repellent
this evening between 5 - 6 pm. Please do not walk on the carpet on
the second floor until after 7:00 pm to give the carpet time to dry.
The stairs and elevators can be used any time. (There was a minor
pest problem on the second floor and we are hoping to head it off).
Thanks for your cooperation.
∂04-Apr-90 1313 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU LICS '90
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Apr 90 13:12:59 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28472; Wed, 4 Apr 90 13:13:08 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10543; Wed, 4 Apr 90 13:13:13 -0700
Message-Id: <9004042013.AA10543@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2945; Wed, 04 Apr 90 13:59:42 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
2902; Wed, 04 Apr 90 13:59:36 CDT
Date: Wed, 4 Apr 90 13:57:14 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
LICS@B.GP.CS.CMU.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: LICS%B.GP.CS.CMU.EDU@VM1.NoDak.EDU
Subject: LICS '90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
[Please forward the following message to you distribution list(s).
The Latex source of the complete registration/ program flyer
will be emailed upon request. Thank you.]
Fifth Annual IEEE Symposium on Logic in Computer Science
June 4-7, 1990
Philadelphia, PA
Sponsored by
IEEE Technical Committee on Mathematical Foundations of Computing
in cooperation with
Association for Computing Machinery
Association for Symbolic Logic
European Association for Theoretical Computer Science
INQUIRIES:
---------
Email registration forms followed by regularly posted checks
will be gratefully received. Further travel information will be
sent by email upon request to lics@cs.cmu.edu.
Other queries:
Registration: (215) 898-4405, jean@central.cis.upenn.edu
Campus Accomodations: (215) 898-3547
Announcements: lics@cs.cmu.edu
ON-CAMPUS ACCOMODATIONS
=======================
Conference accomodations are available both on campus and at a
commercial hotel. The conference auditorium is located half way
between the two, five minutes walk from either one.
Campus accomodations will be in Harnwell House, 3820 Locust
Walk, a 26 story air-conditioned residence hall, with a
permanently staffed front desk. Conference participants will be
lodged in furnished 2--4 bedroom apartments with a shared
bathroom, some with a living room and/or kitchenette, no
television or phone. Pay phones are available in the lobby. A
limited number of private apartments are available for married
couples.
On-campus room and board are available only as a package for
lodging from Sunday the 3rd (check in time 3 pm) to Thursday the
7th (check out 1 pm) with meals from breakfast on Monday to
lunch on Thursday. A meal-only package for those staying
elsewhere is available with registration, and will also be
available on a limited basis at the start of the conference.
For campus accommodations information contact:
Conference Housing Office,
3901 Locust Walk,
Philadelphia, PA 19104-6180,
(215) 898-3547
HOTEL ACCOMMODATIONS
====================
A limited number of rooms have been reserved at a reduced rate
at the Penn Tower Hotel. The rate is $77 for single or double
occupancy. One or two children, 12 or younger, may stay with
parent(s) free of charge. This rate is available from Sunday
June 3rd to Thursday the 7th.
Reservations should be addressed directly to:
Penn Tower Hotel
Civic Center Boulevard at 34th Street
Philadelphia, PA 19104-4385
(800) 356-7366, or (215) 387-8333
The last day for reservation at conference rate is May 3rd. A
one night deposit is required by personal check in $US or by a
major credit card. In correspondence with the hotel please
indicate dates of arrival and departure.
REGISTRATION AND CAMPUS ACCOMODATION FORM
=========================================
Registration fees include conference proceedings and all events.
Subsidies from institutional sponsors allow the LICS organizers
to offer full participation privileges to student registrants.
The reduced rate applies to authors, members of a sponsoring
organization (IEEE Computer Society, ACM, EATCS, ASL), and
members of the organizing and program committees. Early
registration deadline is May 11. Cancellations after May 11
will be subject to a $25 charge for campus housing, and to a $25
charge for LICS registration. Fees are non-refundable after May
18.
The LICS Organizers have limited funds available for subsidy of
attendees unable to obtain travel grants. Persons desiring such
subsidy should contact the Conference Chair, indicating their
circumstances and amount of subsidy desired.
By May 11 After May 11
Full $260 $330
Reduced $210 $270
Full-time student $60 $100
PLEASE TYPE OR PRINT:
Last Name:___________________________________________________
First Name:__________________________________________________
Affiliation:_________________________________________________
Street Address:______________________________________________
City ________________________________________________________
State/Zip:___________________________________________________
Country _____________________________________________________
Phone(s):____________________________________________________
E-mail:______________________________________________________
PLEASE FILL IN AND CHECK AS APPROPRIATE:
Reason for reduced rate:_____________________________________
Full-time student at: _______________________________________
Reservation request:
Single Married couples
Campus Housing $176 $352
Meal Package only $56
O Male
O Female
O Smoker
O Non-smoker
O Vegetarian
O I'll room with____________________________________________
Return this form with a check in $US,
for the total of your registration and
optional package, made out to
"IEEE Fifth LICS Symposium", to
LICS, c/o J. Gallier
Dept. of Computer & Information Science
University of Pennsylvania
200 South 33rd Street
Philadelphia, PA 19104-6389
DISCOUNTED FLIGHTS
==================
USAir has been designated as the official carrier of LICS '90,
and will offer to LICS '90 participants discounts for travel to
Philadelphia from the continental US and Canada, during the
period June 1--10, 1990. For travel from the continental US,
(excluding first class and government contract fares), subject
to applicable fare restrictions, For travel from Canada, with a
2 night minimum stay requirement. There may be discounts on
other USAir international fares.
To obtain a USAir fare discount, you or your travel agent should
call USAir's Convention Office, at (800) 334-8644 (Monday
through Friday, 8 am -- 9 pm EST), and refer to Gold File No.
393570. From Canada call (800) 428-4322, ext. 7702.
CONFERENCE EVENTS
=================
Registration Desk:
-----------------
A registration desk will operate in the Penn Tower Hotel on
Sunday, June 3, 7 -- 9:30 pm. From Monday through Wednesday,
there will be a registration and information desk outside
Meyerson Hall Auditorium, from 8:30 am to 5 pm.
Talks:
-----
All technical talks will be presented in Meyerson Hall
Auditorium, in the basement of the Fine Arts Building.
Contributed talks will be 20 minutes long, with 5 additional
minutes for questions. Session 6 is a special session of
invited papers on Automated Deduction, organized by Mark
Stickel. These presentations will be 30 minutes long.
Sunday Reception:
----------------
On June 3 there will be a welcome reception from 7 to 9:30 pm,
at the Penn Tower Hotel. Free soft drinks and light snacks will
be served, and a cash bar will be available.
Monday Reception and Business Meeting:
-------------------------------------
On June 4 there will be a reception at the University Museum (at
33rd and Spruce Streets), in the Upper Egyptian Gallery and
Chinese Rotunda, with drinks and light dinner buffet from 6:30
to 8:30 pm. A business meeting for all attendees will follow
from 8:30 pm with wine and soft drinks.
Wednesday Banquet:
-----------------
On June 6 there will be a banquet at the Franklin Institute.
From 6:30 pm you are invited to visit scientific exhibits at the
Institute. The banquet will start around 7:30 pm, and will
include a historical talk about Alan Turing, by Robin Gandy of
Oxford University.
******************
CONFERENCE PROGRAM
******************
MONDAY, June 4
--------------
SESSION 1. 9:00--10:40. Chair: John Mitchell.
---------
Type reconstruction in finite-rank fragments of polymorphic
lambda-calculus,
A.J. Kfoury (Boston U) & J. Tiuryn (Warsaw)
Polymorphism, set theory, and call-by-value,
E. Robinson (Sussex) & G. Rosolini (Parma)
Universal domains in the theory of denotational semantics
of programming languages,
M. Droste & R. G"obel (Essen)
The classification of continuous domains,
A. Jung (TH Darmstadt & Imperial Coll.)
SESSION 2. 11:10--12:25. Chair: Krzysztof Apt.
---------
A decision procedure for a class of set constraints,
N. Heintze (CMU) & J. Jaffar (IBM/Watson)
A constraint sequent calculus,
J.-L. Lassez (IBM/Watson) & K. McAloon (CUNY)
Solving inequations in term algebras,
H. Comon (Paris XI)
SESSION 3. 2:25--3:40. Chair: Jon Barwise.
---------
The dynamic logic of permission,
R. van der Meyden (Rutgers)
A theory of non-monotonic rule systems,
W. Marek (Kentucky) & A. Nerode (Cornell)
The semantics of reflected proof,
S. Allen, R. Constable, D. Howe & W. Aitken (Cornell)
SESSION 4. 4:20--6:00. Chair: Glynn Winskel.
---------
Equation solving through an operational semantics of context,
K. Larsen & L. Xinxin (Aalborg)
Three logics for branching bisimulation,
R. De Nicola (IEI-CNR) & F. Vaandrager (CWI)
Reactive, generative, and stratified models of probabilistic
processes,
R. van Glabbeek (CWI), S. Smolka (Stony Brook),
B. Steffen (Aarhus) & C. Tofts (Edinburgh)
The nonexistence of finite axiomatisations for CCS congruences,
F. Moller (Edinburgh)
TUESDAY, June 5
---------------
SESSION 5. 9:00--10:40. Chair: Steve Cook.
---------
0-1 Laws for infinitary logics,
Ph. Kolaitis (UCSC) & M. Vardi (IBM/Almaden)
Implicit definability on finite structures and unambiguous
computations,
Ph. Kolaitis (UCSC)
Alogtime and a conjecture of S.A. Cook,
P. Clote (Boston Coll.)
On the expression of monadic second-order graph next properties
without quantifications over sets of edges,
B. Courcelle (Bordeaux I)
SESSION 6. 11:10--12:40. Chair: Mark Stickel.
special session on automated deduction
--------------------------------------
Searching for fixed point combinators with the kernel method,
W. McCune (Argonne NL)
Theorem proving with ordered equations,
N. Dershowitz (Illinois/Urbana)
Automated reasoning in geometry using algebraic methods,
S.-Ch. Chou (UT/Austin)
SESSION 7. 2:25--3:40. Chair: Ugo Montanari.
---------
Normal process representatives,
V. Gehlot & C. Gunter (U Penn)
A categorical linear framework for Petri nets,
C. Brown & D. Gurr (Edinburgh)
A linear semantics for allowed logic programs,
S. Cerrito (Paris XI)
SESSION 8. 4:20--6:00. Chair: Jean-Pierre Jouannaud.
---------
Programming in equational logic: beyond strong sequentiality,
R.C. Sekar & I.V. Ramakrishnan (Stony Brook)
The theory of ground rewrite systems is decidable,
M. Dauchet & S. Tison (Lille-Flandres-Artois)
Well rewrite orderings,
P. Lescanne (CRIN)
A constructive proof of Higman's Lemma,
C. Murthy & J. Russell (Cornell)
WEDNESDAY, June 6
-----------------
SESSION 9. 9:00--10:40. Chair: Jean Gallier.
---------
Syntactic theories and unification,
C. Kirchner & F. Klay (INRIA/Lorraine & CRIN)
Proof transformations for equational theories,
T. Nipkow (Cambridge)
A new AC unification algorithm with an algorithm for solving
diophantine equations,
A. Boudet, E. Contejean & H. Devie (Paris XI)
On subsumption and semiunification in feature algebras,
J. D"orre (Stuttgart) & W. Rounds (U Michigan)
SESSION 10. 11:10--12:25. Chair: Susumu Hayashi.
----------
Completeness for typed lazy inequalities,
S. Cosmadakis (IBM/Watson), A.R. Meyer (MIT) & J. Riecke (MIT)
Conditional lambda-theories and the verification of static
properties of programs,
M. Wand & Zh.-Y. Wang (Northeastern)
Single-threaded polymorphic lambda calculus,
J. Guzman & P. Hudak (Yale)
SESSION 11. 2:25--3:40. Chair: Andre Scedrov.
----------
Extensional PERs,
P. Freyd (U Penn), P. Mulry (Colgate),
G. Rosolini (Parma) & D. Scott (CMU)
A PER model of polymorphism and recursive types,
M. Abadi (DEC/SRC) & G.D. Plotkin (Edinburgh)
Effective domains and intrinsic structure,
W. Phoa (Cambridge)
SESSION 12. 4:20--6:00. Chair: Edmund Clarke.
----------
A logic of concrete time intervals,
H. Lewis (Harvard)
Real-time logics: complexity and expressiveness,
R. Alur & T. Henzinger (Stanford)
Explicit clock temporal logic,
E. Harel, A. Pnueli & O. Lichtenstein (Weizmann)
Model-checking for real-time systems,
R. Alur (Stanford), C. Courcoubetis (Bell Labs) & D. Dill (Stanford)
BANQUET
-------
The life and work of Alan Turing,
R. Gandy (Oxford)
THURSDAY, June 7
----------------
SESSION 13. 9:00--10:40. Chair: Paris Kanellakis.
----------
Symbolic model checking: 10↑20 states and beyond,
J.R. Burch, E.M. Clarke & K.L. McMillan (CMU);
D.L. Dill & L.J. Hwang (Stanford)
When is "partial" adequate? A logic-based proof technique using
partial specifications,
R. Cleaveland (NC State) & B. Steffen (Aarhus)
Modelling shared state in a shared action model,
K. Goldman & N. Lynch (MIT)
On the limits of efficient temporal decidability,
A. Emerson (UT/Austin & MCC), M. Evangelist
(MCC) & J. Srinivasan (UT/Austin & MCC)
SESSION 14. 11:10--12:25. Chair: Daniel Leivant.
----------
On the power of bounded concurrency: reasoning about programs,
D. Harel (Weizmann), R. Rosner (Weizmann) &
M. Vardi (IBM/Almaden)
New foundations for fixpoint computations,
R. Crole & A. Pitts (Cambridge)
Recursive types reduced to inductive types,
P. Freyd (U Penn)
END OF CONFERENCE
INSTITUTIONAL SPONSORS
----------------------
Academic Press, publisher of Information and Computation
DEC SRC
GTE Laboratories
Hewlett-Packard Laboratories
IBM Research (Almaden and Yorktown Heights)
Mitre Corporation
The University of Pennsylvania
Xerox PARC
CONFERENCE ORGANIZATION
=======================
LICS General Chair: Albert R. Meyer
1990 Conference Chair: Jean Gallier
1990 Program Chair: John C. Mitchell
Publicity Chair: Daniel Leivant
PROGRAM COMMITTEE:
-----------------
K.R. Apt, J. Barwise, E. Clarke, S. Cook, S. Hayashi, P. Kanellakis,
J.-P. Jouannaud, D. Leivant, J.C. Mitchell (Chair), U. Montanari,
A. Pitts, E. Sandewall, A. Scedrov, M. Stickel, and G. Winskel.
ORGANIZING COMMITTEE:
--------------------
M. Abadi, J. Barwise, A. Chandra, E. Dijkstra, E. Engeler, J. Gallier,
J. Goguen, D. Gries, Y. Gurevich, D. Johnson, G. Kahn, J.W. Klop,
D. Kozen, D. Leivant, Z. Manna, A.R. Meyer (General Chair), G. Mints,
J.C. Mitchell, Y. Moschovakis, C. Papadimitriou, R. Parikh, G. Plotkin,
G. Rozenberg, D. Scott, and R. de Vrijer.
∂04-Apr-90 1449 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Complex system Seminar now
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 4 Apr 90 14:49:19 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Wed, 4 Apr 90 13:31:25-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Wed, 4 Apr 90 13:29:18 PDT
Date: Wed, 4 Apr 90 13:31 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Complex system Seminar now
To: complex-systems@Warbucks.AI.SRI.COM
Message-ID: <19900404203142.7.BERGMAN@HUXLEY.AI.SRI.COM>
∂04-Apr-90 1623 LOGMTC-mailer MSRI Seminar Announcements, April 9-13
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 4 Apr 90 16:23:28 PDT
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA18907; Wed, 4 Apr 90 16:23:08 PDT
Received: by msri.org (4.0/SMI-4.0)
id AA18850; Wed, 4 Apr 90 16:20:12 PDT
Date: Wed, 4 Apr 90 16:20:12 PDT
From: david@msri.org (David Mostardi)
Message-Id: <9004042320.AA18850@msri.org>
To: weekly@msri.org
Subject: MSRI Seminar Announcements, April 9-13
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Seminar Announcements for April 9 - 13, 1990
Monday, April 9
MSRI-EVANS MONDAY LECTURE 4:15 60 Evans Hall
T. Goodwillie "Homotopy Functors as Differentiable Functions"
Tuesday, April 10
ALGEBRAIC TOPOLOGY 9:30 MSRI Lecture Hall
R. Lee "Topological Invariants of Three Manifolds From Conformal Field Theories"
MODEL THEORY 12:30 MSRI Seminar Room
L. Newelski "A Model and Its Subset"
NUMBER THEORY AND ALGORITHMS 2:15 MSRI Seminar Room
K. McCurley "Asymptotically Fast Triangularization of Matrices Over Rings"
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
T. Goodwillie "Cyclotomic Trace Map" XIII
Wednesday, April 11
NO LECTURES SCHEULED TODAY
Thursday, April 12
ALGEBRAIC K- THEORY 9:30 MSRI Lecture Hall
J. Jones "Segal's Approach to Conformal Field Theory"
NUMBER THEORY AND ALGORITHMS 10:00 MSRI Seminar Room
H. Lenstra "The Holes in the Number Field Sieve"
CROSS CULTURAL 11:00 MSRI Lecture Hall
A. Kechris "Descriptive Aspects of Borel Group Actions and Equivalence Relations" II
CENTER FOR PURE & APPLIED MATHEMATICS LUNCH TALK 12:10 (Bring your lunch)
A. der Kiureghian"Probabilistic Assessment of Structural Safety" 12:45 Faculty Club Conf. Rm
MODEL THEORY 1:00 MSRI Seminar Room
C. Wood "Amalgamation Classes for Somewhat Homogeneous Posets"
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
W.-C. Hsiang "Computing the Clyclotomic Trace Map" I
INFORMAL CORE MODEL SEMINAR 2:30 MSRI Seminar Room
P. D. Welch "Fine Structure" IV
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
J. Keller "Ray Methods in Number Theory and Combinatorics"
Friday, April 13,
NO LECTURES SCHEDULED FOR TODAY
∂04-Apr-90 1649 ingrid@russell.Stanford.EDU CSLI Calendar, 5 April, vol. 5:22
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Apr 90 16:49:04 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA21757; Wed, 4 Apr 90 16:05:42 PDT
Date: Wed, 4 Apr 90 16:05:42 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004042305.AA21757@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 5 April, vol. 5:22
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
5 April 1990 Stanford Vol. 5, No. 22
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 5 APRIL 1990
12:00 noon TINLunch
Cordura 100 Variation Across a Population of American
English Speakers
Meg Withgott and Francine Chen
Xerox PARC
(withgott.pa@xerox.com, fchen.pa@xerox.com)
Abstract in last week's Calendar
CSLI ACTIVITIES FOR NEXT THURSDAY, 12 APRIL 1990
12:00 noon TINLunch
Cordura 100 A Representationalist Theory of Intention
Kurt Konolige and Martha E. Pollack
SRI International
(konolige@ai.sri.com, pollack@ai.sri.com)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Computational Morphology
Speaker: Lauri Karttunen
Xerox PARC
(lauri@csli.stanford.edu)
Abstract below
4:15 p.m. CSLI Colloquium
Ventura 17 Precompiled Syntactic Constraints for
Continuous Speech Recognition
Pierre Dupont
Philips Research Laboratory, Brussels
(dupont@prlb.philips.be)
Abstract below
____________
CSLI SPRING SEMINAR SERIES
Controversies in Natural-Language Research
led by Stanley Peters
Thursdays, 2:15 p.m.
Cordura 100
The CSLI Seminar for spring quarter will start on 12 April, when Lauri
Karttunen will discuss research by Ron Kaplan, Martin Kay, and Korvo
Koskeniemmi, among others, on Finite State Morphology. Then Paul
Kiparsky and Bill Poser will discuss current linguistic theories of
morphology on 19 April. The following Thursday, 26 April, the five
CSLI members among these six will debate, to bring out
complementarities and conflicts of the approaches.
A similar sequence of three seminars on syntax, and a like sequence
on semantics, will take place in May and June.
____________
NEXT WEEK'S TINLUNCH
A Representationalist Theory of Intention
Kurt Konolige and Martha E. Pollack
We present a theory of intention that begins with an account of the
ways in which agents form, execute, monitor, and revise their plans in
response to multiple goals in dynamic environments. Our account of
intention is developed by considering the internal planning structure
of agents, and relating it to the agent's behavior in the world. The
resulting theory is a propositional attitude one in that it depends on
the actions that the agent performs; however, it goes further in
making a commitment to agents having internal plan structures that
affect their behavior. Because we consider the plan structures to be
sentences in some internal language for describing plans, our approach
is _representationalist_. We show how increasingly complex notions of
intention arise naturally in the theory, and argue that the
representationalist stance allows us to provide a better
characterization of intention than the most fully developed
alternative proposal, that of Cohen and Levesque.
____________
NEXT WEEK'S CSLI SEMINAR
Computational Morphology
Lauri Karttunen
Morphology, the least glamorous of the maids in the castle of
linguistic theory, is stuck in a bygone area. In morphology it is
generally assumed that words arise from minimally specified underlying
representations through elaborate derivations. These derivations
generally involve transformational rules, rule ordering, derivational
cycles, transderivational constraints, and other arcane machinery.
>From the looks of it, morphology is a very difficult subject. Given
the Byzantine complexity of derivations, it is clear that complete
rule systems are unattainable at the present stage of knowledge.
Articles in morphology typically involve partial descriptions of a
handful of word forms. These partial accounts only address the
problem of how surface forms are generated from underlying abstract
morphemes. Generation being as hard as it is, with the tools at hand
recognition is clearly impossible.
Outside the castle of linguistic theory, work has progressed on the
construction of intelligent systems for text processing, machine
translation, voice recognition, and other such mundane practical
tasks. For these applications it is essential to recognize and
identify words correctly. A system of rules that can be used for
generation but not for recognition is useless. Gross incompleteness
is unacceptable. Recognition and generation must be accomplished in
real time.
Although the state of morphological theory, as practiced in the
castle, virtually precludes them, there now exist systems with
comprehensive lexicons and substantive rule components that generate
and recognize the vast majority of word forms in languages as diverse
as Finnish, English, and Arabic. These applications are based on two
simple theoretical insights: (1) Morphological alternations can be
characterized mathematically as regular relations -- even in cases
where the traditional way of describing them suggests greater
complexity. Consequently, rules that describe such alternations can
be implemented as finite-state transducers. (2) By and large, the set
of possible combinations of stems and affixes can be encoded as a
finite-state network.
Although this new technology in itself does not embody any new
linguistic or psychological insights, it raises fundamental issues
that classical morphology has mused over, but not very seriously.
What exactly are morphological derivations about? What is the status
of rules? Are they applied to something or true of something? What
is the structure of the lexicon as a whole? I will try to explain the
relevance of these issues in the context of computational morphology.
____________
NEXT WEEK'S CSLI COLLOQUIUM
Precompiled Syntactic Constraints for Continuous
Speech Recognition
Pierre Dupont
Language models are needed to force speech-recognition systems to
produce syntactically correct sentences. However, integration of
linguistic knowledge in a recognition system raises two types of
problems. First, the computational overhead required to handle the
linguistic constraints should be reduced to a minimum. Second, the
syntactic rules interact with the acoustic decoding and this implies
in particular that the linguistic representation should be able to
work in predictive mode. More precisely, given a partial sentence
hypothesis, the language model should predict the list of legal word
successors. Since, in fact the acoustic decoding is performed at the
phoneme level, this prediction may be formulated in terms of phonemes
that can follow an end of word hypothesis.
The present approach is based on a language model expressed in the
context-free formalism. This formalism offers two advantages. First,
it is more powerful than the classical language models used in
speech-recognition systems like regular grammars or word-pair models.
Second, the context-free formalism is the backbone of several
higher-level linguistic formalism, PATR-II amongst them.
An efficient interface between the acoustic decoding module and the
language model has been designed. This interface consists in a
representation of the language model by means of recursive transition
networks, which can be dynamically and locally expanded in a
finite-state network during recognition. Each network associated with
a nonterminal symbol is precompiled offline. Consequently, the actual
syntactic work during recognition reduces to the insertion of
subnetworks copies.
____________
SEMINAR ON THOUGHT AND LANGUAGE
Julius Moravcsik
(julius@csli.stanford.edu)
Wednesdays, 6:00-8:00 p.m.
Cordura 104
I will give a seminar based on material covered in my book _Thought
and Language (Routledge, 1990). Graduate students from philosophy and
related disciplines can earn credit by signing up for Philosophy 286
(a final paper will be required).
I will spend the first five meetings on the ontology that we need for
an adequate theory of language; then two sessions on the relation of
this material to psycholinguistics or developmental cognitive
psychology; and then three or four sessions on lexical semantics.
Depending on the availability of a couple of visitors, we might switch
the semantics and psychology material around so that the latter will
be discussed at the last sessions.
For the first five sessions, our program is as follows:
-- general introduction, sketch of lexical semantics and the ontology
it requires, and recent attacks on such ontologies (4/4);
-- the two circles (extensional and intensional) -- why should one
have priority over the other? (4/11);
-- can there be a noncircular account of universals? (4/18);
-- identity, individuation, and persistence (4/25);
-- the reality of events and their equal status with material
objects (5/2).
We will work out other topics as we go along. For those with less
preparation, the first half of my book gives background; in the second
half, the topics mentioned above are discussed and specific proposals
presented.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
A Disproof of Bell's Theorem
Yalcin Koc
Bogazici University, Istanbul, Turkey
visiting at
Center for the Philosophy and History of Science
Boston University
Friday, 6 April, 12:00 noon
Building 200, Room 305
No abstract available.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Bruno De Finetti's Bayesianism
Maria Carla Galavotti
University of Bologna, Italy
Friday, 6 April, 3:15 p.m.
Building 90, Room 92Q
No abstract available.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Spatial Hearing: The Importance of Edges
Ervin Hafter
University of California, Berkeley
Wednesday, 11 April, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
NEW CSLI VISITOR
Yasuyoshi Inagaki
Professor
Department of Information Engineering
and Department of Electronics
Nagoya University, Japan
Dates of visit: 1 April-30 June 1990
Yasuyoshi is on sabbatical from Nagoya University for seven months.
He is interested in formal semantics of languages and theoretical
aspects of natural-language understanding as a foundation for
developing a highly friendly interface between humans and computers.
While at CSLI, he would like to learn about situation theory
and situation semantics and to work on papers on some related topics.
His research interests include reasoning under incomplete information
or commonsense reasoning as well as algebraic approaches to software
development.
∂04-Apr-90 1653 LOGMTC-mailer Seminar in Logic and Foundations of Mathematics
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Apr 90 16:53:08 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA01278; Wed, 4 Apr 90 16:55:12 PDT
Date: Wed, 4 Apr 1990 16:55:09 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Seminar in Logic and Foundations of Mathematics
Message-Id: <CMM.0.88.639273309.sf@csli.stanford.edu>
Speaker: Prof. Vladimir Uspensky
Dept. of Mathematics, Moscow State University
Title: Definitions of randomness from an algorithmic point of view.
Time: Monday, April 9, 4:15-5:30 PM
Place: Room 381-T, first floor Math Corner, Stanford
S. Feferman
∂05-Apr-90 0912 dietrich@sierra.Stanford.EDU Lost mail
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Apr 90 09:12:14 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Thu, 5 Apr 90 09:07:30 PDT
Date: Thu, 5 Apr 90 09:07:30 PDT
From: dietrich@sierra.Stanford.EDU (Katherine F. Dietrich)
To: EE-faculty@sierra.Stanford.EDU
Cc: EE-adminlist@sierra.Stanford.EDU, dietrich@sierra.Stanford.EDU
Subject: Lost mail
Message-Id: <CMM.0.88.639331649.dietrich@>
If anyone has received any mail for Dr. Ben-Zion Y. Amitai,
please contact me immediately.
Thank you,
Kathy Dietrich
x3-2877
∂05-Apr-90 1522 ingrid@russell.Stanford.EDU CSLI events on 4/6 and 4/9
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Apr 90 15:21:57 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA29108; Thu, 5 Apr 90 14:49:25 PDT
Date: Thu, 5 Apr 90 14:49:25 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004052149.AA29108@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI events on 4/6 and 4/9
LINGUISTICS DEPARTMENT COLLOQUIUM
"Conjunct/Disjunct" Systems in Tibeto-Burman Languages
Scott Delancey
University of Oregon, Eugene
Friday, 6 April, 3:15 p.m.
Cordura 100
Several Tibeto-Burman languages show a distinction in the copula
and/or the finite verb system between two forms, which have been
labeled "conjunct" and "disjunct." Conjunct forms are used:
- in main clauses, with first-person subject in statements, or
second-person subject in direct questions;
- in complement clauses of verbs of speaking or cognition, when the
higher and lower subject are coreferential;
- in languages where the distinction is made in the verb system,
conjunct forms occur only with volitional predicates.
In all other circumstances -- nonfirst-person statements,
nonsecond-person questions, complement clauses with noncoreferential
subject, and in any case with nonvolitional predicates -- the disjunct
forms occur.
I will present a detailed description of the system in modern Tibetan,
showing that it is based on an evidential distinction. I will also
discuss the historical/comparative status of the distinction within
Tibeto-Burman.
____________
MATHEMATICS DEPARTMENT COLLOQUIUM
Definitions of Randomness from an Algorithmic Point of View
Vladimir Uspensky
Department of Mathematics, Moscow State University
Monday, 9 April, 4:15-5:30 p.m.
Building 380, Room 381-T
No abstract available.
____________
∂05-Apr-90 1630 gilberts@Sunburn.Stanford.EDU MJH Closing at 4:15 Today
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Apr 90 16:30:17 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10930; Thu, 5 Apr 90 16:02:58 -0700
Date: Thu, 5 Apr 1990 16:02:58 PDT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: CSD-List@Sunburn.Stanford.EDU
Subject: MJH Closing at 4:15 Today
Message-Id: <CMM.0.88.639356578.gilberts@Sunburn.Stanford.EDU>
because of President Kennedy's talk this afternoon at 4:30.
∂05-Apr-90 2338 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Apr 90 23:38:48 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA16030; Thu, 5 Apr 90 20:07:10 PDT
Date: Thu 5 Apr 90 20:07:09-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <639374829.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
The First SYMBOLIC SYSTEMS FORUM of Spring Quarter
Thursday, April 26, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Peter Cheeseman
Topic: "The General Theory of Induction"
ABSTRACT
--------
The basic theory of induction of models (theories) from
data has evolved over the last three centuries, and thanks
to cheap available computing, this theory now gives
practical solutions to inductive problems. Starting from
very basic first principles, the Bayesian calculus is shown
to be the theory of belief under uncertainty. This theory
automatically provides the necessary trade-off between the
fit to the data and the complexity of the model.
Many philosophers in the past have recognized that this
trade-off is necesary (e.g. Ockham's Razor), but the Bayesian
theory provides a quantitative solution. This solution
requires a prior probability over possible models, and it is
this requirement that causes many to reject the Bayesian
solution, because it appears to introduce a subjective
element into inductive inference.
This talk will show the necessity of prior knowledge,
and show how very weak prior knowledge can be translated
into a bland "uninformative" prior. In addition the
Bayesian approach will be shown to give answers that do not
depend on the language used to frame the inductive problem.
These philosophicalpoints will be illustrated by examples
Bayesian induction that far exceed human abilities.
As usual, refreshments will be served.
The Symbolic Systems Forum meets every Thursday at 4:15 pm in
building 60, room 61-G. A complete schedule of speakers for
spring quarter will be published soon. If you would like to
have your name added to the mailing list, contact Bill Grundy
at grundy@csli.stanford.edu.
-------
∂06-Apr-90 0904 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 08:30:42 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06715; Fri, 6 Apr 90 06:06:30 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18360; Fri, 6 Apr 90 06:05:48 -0700
Message-Id: <9004061305.AA18360@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6178; Fri, 06 Apr 90 07:59:57 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6074; Fri, 06 Apr 90 07:56:48 CDT
Date: Fri, 6 Apr 90 04:14:23 CDT
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
"William J. Joel" <JZEM@MARIST.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: "William J. Joel" <JZEM%MARIST.BITNET@VM1.NoDak.EDU>
Subject: GRG Seminar Series
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
GRAPHICS RESEARCH GROUP SEMINAR SERIES
======================================
Title Drawing Fractals (or Anything Else)
By Repetition
Speaker Richard J. McGovern
Marist College
Date Thursday, April 12, 1990
Time 9:50 - 11:10 am
Place Lowell Thomas Communication Center, Rm. 005
Marist College, Poughkeepsie, NY
Abstract This talk is an elementary introduction to
drawing figures based on data sets generated
via iterated functions systems as described
by Michael Barnsley. It should be comprehen-
sible to anyone who can evaluate a function
on a set. Several applications of this tech-
nique will be demonstrated. This talk is
jointly sponsored with the Mathematics Collo-
quium.
+--------------------------------------------------------------------------+
+ It is a capital mistake to theorize before one has data. +
+ Insensibly one begins to twist facts to suit theories, instead +
+ of theories to suit facts. +
+ (Sherlock Holmes) +
+--------------------------------------------------------------------------+
Bill Joel
Graphics Research Group
jzem@marist.bitnet
∂06-Apr-90 0905 chandler@Sunburn.Stanford.EDU Next Tuesday's Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 09:05:16 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20273; Fri, 6 Apr 90 09:05:00 -0700
Date: Fri, 6 Apr 1990 9:04:59 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Next Tuesday's Faculty Lunch
Message-Id: <CMM.0.88.639417899.chandler@Sunburn.Stanford.EDU>
Be sure your calendar is marked.....Tuesday, April 10, 12:15 in MJH-146. No
formal topic yet....but stay tuned.
∂06-Apr-90 1016 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU GRG Seminar Series
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 10:16:12 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06703; Fri, 6 Apr 90 06:05:37 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18344; Fri, 6 Apr 90 06:00:46 -0700
Message-Id: <9004061300.AA18344@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6025; Fri, 06 Apr 90 07:56:25 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5994; Fri, 06 Apr 90 07:56:23 CDT
Date: Fri, 6 Apr 90 04:13:51 CDT
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
"William J. Joel" <JZEM@MARIST.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: "William J. Joel" <JZEM%MARIST.BITNET@VM1.NoDak.EDU>
Subject: GRG Seminar Series
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
G R A P H I C S R E S E A R C H G R O U P
S E M I N A R S E R I E S
Title Computers, Pattern, Chaos and Beauty
Speaker Cliff Pickover
T.J. Watson Research Center
IBM Corporation
Date April 19, 1990
Time 9:50 am - 11:00 am
Place Lowell Thomas Communication Center, Rm. 005
Marist College
Poughkeepsie, NY 12601
Abstract This talk could be subtitled "Adventures in Computing".
The audience is taken on a roller-coaster ride through
various scientific and artistic realms. The talk is
divided into three main sections. The first part of
the talk gives background information on computer
graphics and the creative use of computers. The second
part of the talk describes various graphical methods
for representing and detecting patterns in complicated
data. The third part of the talk illustrates simple
techniques for visualizing graphically interesting man-
ifestations of chaotic behavior.
(Contact jzem@marist.bitnet for more information.)
+--------------------------------------------------------------------------+
+ The past is but the beginning of a beginning, and all that is +
+ and has been is but the twilight of the dawn. +
+ (The Discovery of the Future, H.G. Wells) +
+--------------------------------------------------------------------------+
Bill Joel
jzem@marist.bitnet
∂06-Apr-90 1038 LOGMTC-mailer Abstract for Uspensky talk
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 10:38:17 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA04703; Fri, 6 Apr 90 10:40:23 PDT
Date: Fri, 6 Apr 1990 10:40:21 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Abstract for Uspensky talk
Message-Id: <CMM.0.88.639423621.sf@csli.stanford.edu>
Speaker: Prof. Vladimir A. Uspensky, Dept of Mathematics, Moscow University
Title: "Definitions of randomness from the algorithmic point of view"
Time: Monday, April 9, 4:15-5:30 PM
Place: Room 381-T, first floor, Math Corner Stanford
Abstract:
Random sequences of digits possess three fundamental features:
-they are typical,
-they are chaotic,
-they are stochastic.
For a sequence to be typical is to belong to any reasonable majority.
For a sequence to be chaotic is to have no reasonable law governing the
alternation of its terms.
For a sequence to be stochastic is to possess the property of frequency
stability in any reasonable subsequence.
To make these informal ideas clear one needs to assign formal semantics to
each of the three occurrences of the word 'reasonable'. Each such attempt
leads to a version of a definition of randomness.
∂06-Apr-90 1042 grundy@csli.Stanford.EDU Symbolic Systems Forum correction
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 10:42:44 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA04202; Fri, 6 Apr 90 10:28:21 PDT
Date: Fri 6 Apr 90 10:28:18-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum correction
To: grundy@csli.Stanford.EDU
Message-Id: <639426498.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
Correction: The date listed on the Symbolic Systems Forum
announcement for Peter Cheeseman's talk was incorrect. He
will be speaking NEXT Thursday, April 12 -- not April 26.
Sorry for the confusion.
Bill
-------
∂06-Apr-90 1412 chandler@Sunburn.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 14:12:12 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27797; Fri, 6 Apr 90 14:12:00 -0700
Date: Fri, 6 Apr 1990 14:12:00 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Publication
Message-Id: <CMM.0.88.639436320.chandler@Sunburn.Stanford.EDU>
I have just received an NSF publication "Software Capitalization Grants:
Distributing and Sharing Research Software" ... Program announcement. Let me
know if you would like to see a copy.
∂06-Apr-90 1504 grundy@csli.Stanford.EDU Symbolic Systems Forum Spring Schedule
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 14:51:36 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA13557; Fri, 6 Apr 90 14:05:55 PDT
Date: Fri 6 Apr 90 14:05:54-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum Spring Schedule
To: grundy@csli.Stanford.EDU
Message-Id: <639439554.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
THE SYMBOLIC SYSTEMS FORUM
Preliminary Schedule for Spring Quarter, 1990
The Symbolic Systems Forum meets every Thursday
at 4:15 pm in building 60, room 61G.
April 12
Peter Cheeseman
"The General Theory of Induction"
April 19
Stanley Peters
"Overview of Research at the Center for the Study of
Language and Information"
NOTE: The April 19 forum will include a tour of the
facilities at CSLI. Therefore, we will NOT meet in
building 60; instead, we will meet at CSLI, in Cordura
Hall, room 100 (the conference room). Cordura Hall is
located on the corner of Campus Drive and Panama
Street.
April 26
Jon Barwise
"Applications of Non-wellfounded Sets in Symbolic
Systems"
May 3
Ben Libet, Professor of physiology, UC San Francisco
"The Neurophysiology of Conscious Experience"
May 10
Speaker to be announced
May 17
Rene Girard
"The Genesis of Symbolic Forms in Human Culture"
May 24
J. P. Dupuy
Title to be announced
May 31
Seniors in the Symbolic Systems Program honors program
present their work.
Refreshments are served every week at the forum.
If you would like to be added to the Symbolic Systems Forum
electronic mailing list, send a note to Bill Grundy at
grundy@csli.stanford.edu.
-------
∂06-Apr-90 1746 ingrid@russell.Stanford.EDU IAP Corporate Advisory Board Meeting, 10/11 April 1990
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Apr 90 17:46:07 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA06988; Fri, 6 Apr 90 17:15:30 PDT
Date: Fri, 6 Apr 90 17:15:30 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004070015.AA06988@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: IAP Corporate Advisory Board Meeting, 10/11 April 1990
Center for the Study of Language and Information (CSLI)
Industrial Affiliates Program (IAP)
Corporate Advisory Board Meeting
10-11 April 1990
Cordura 100
CSLI will hold its second annual Industrial Affiliates Program
Corporate Advisory Board Meeting on 10 and 11 April. Below is a
listing of the presentations that are open to the public:
Tuesday, 10 April:
1:15 Welcoming Remarks
1:30 Elephant 2000: A Programming Language Based on Speech Acts
John McCarthy
2:30 Break
3:00 Machine Translation as a Theoretical Enterprise
Martin Kay
4:00 The XL Project
Peter Sells
4:30 Heterogeneous Reasoning
John Etchemendy
Wednesday, 11 April:
9:00 Language, Computation, and Work Practices
Terry Winograd
10:00 Phrasal Phonology
William Poser
10:30 Generating Information from Context with PROSIT
Stanley Peters/Hinrich Schuetze
∂06-Apr-90 1806 LOGMTC-mailer Talk by Rob van Glabbeek
Received: from coraki.stanford.edu by SAIL.Stanford.EDU with TCP; 6 Apr 90 18:06:45 PDT
Received: by coraki.stanford.edu (4.0/25-eef) id AA02616; Fri, 6 Apr 90 18:07:38 PDT
Message-Id: <9004070107.AA02616@coraki.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Talk by Rob van Glabbeek
Cc: pratt@coraki.stanford.edu
Date: 06 Apr 90 18:07:37 PDT (Fri)
From: pratt@cs.stanford.edu
Rob van Glabbeek, of CWI and the Vrije Universiteit of Amsterdam, will
be visiting here next week in connection with the software systems
faculty search. He will give two talks. The first, on Thursday
morning in CIS-101 from 9:30 to 11, will be aimed at a general
audience. It will give some overview of the state of concurrency
modelling, as well as covering some of van Glabbeek's contributions.
The second, to be scheduled some time on Friday, will also be on
concurrency, but will be aimed more at the MTC community here.
What is a good time for the second talk? I have in mind scheduling it
for Friday at 10 am.
Vaughan Pratt
∂08-Apr-90 1952 vivluo@Sunburn.Stanford.EDU advisor/advisee guidelines
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Apr 90 19:52:32 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20837; Sun, 8 Apr 90 19:52:42 -0700
Sender: Vivian Luo <vivluo@Sunburn.Stanford.EDU>
Date: Sun, 8 Apr 1990 19:52:41 PDT
From: ugrad-cs-rep@cs.Stanford.EDU
Reply-To: ugrad-cs-rep@cs.Stanford.EDU
To: faculty@cs.Stanford.EDU
Cc: ugrad-cs-rep@cs.Stanford.EDU
Subject: advisor/advisee guidelines
Message-Id: <CMM.0.88.639629561.vivluo@Sunburn.Stanford.EDU>
Dear CS Faculty,
To improve the communication between advisors and advisees, we would
like to create two sets of guidelines: one for what is expected of
students, and the other describing the role of an advisor. We would
like to hear what you think should be included in these guidelines.
Your feedback is greatly appreciated!
Thank you,
Tony and Vivian
ugrad-cs-rep@cs
∂08-Apr-90 2006 vivluo@Sunburn.Stanford.EDU Majors Event 4/18
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Apr 90 20:06:18 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20934; Sun, 8 Apr 90 20:06:30 -0700
Sender: Vivian Luo <vivluo@Sunburn.Stanford.EDU>
Date: Sun, 8 Apr 1990 20:06:29 PDT
From: luo@cs.Stanford.EDU
Reply-To: luo@cs.Stanford.EDU
To: faculty@cs.Stanford.EDU
Cc: luo@cs.Stanford.EDU
Subject: Majors Event 4/18
Message-Id: <CMM.0.88.639630389.vivluo@Sunburn.Stanford.EDU>
Dear Faculty,
This year's Majors Event is on Wednesday, April 18, 10am-2pm in the Quad.
The Majors Event allows undeclared undergraduates to speak to representatives
from the various departments at Stanford.
We are still looking for a new logo to replace "Computer Science - The
Choice of a New Generation". Please send your creative ideas to me!
Also, we need some faculty members to speak to the students for an hour
or two. Please let me know if you'd like to come, and what time you
can attend.
Thank you!
Vivian
Undergraduate CS Course Advisor
luo@cs
∂09-Apr-90 0753 chandler@Sunburn.Stanford.EDU CSD 25th Anniversary
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 07:52:51 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26596; Mon, 9 Apr 90 07:53:32 -0700
Date: Mon, 9 Apr 1990 7:53:31 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: CSD 25th Anniversary
Message-Id: <CMM.0.88.639672811.chandler@Sunburn.Stanford.EDU>
Notes from Planning Meeting for CSD 25th Anniversary
Faculty Club, April 4, 1990
In attendance: Tom Bredt, Ed Feigenbaum, John Levy, John Shoch,
George Wheaton, Voy Wiederhold
The group agreed that it wanted to make it a very special
occasion. Various themes were discussed. A short summary
follows:
1) Have a time capsule. EAF suggested having a chip with
a theorum to prove. At a time when humans can prove it,
it will open itself.
2) Have a special issue of SIGPLAN. It was agreed this would
be better than just another special birthday issue
without a sponsor.
3) Just have fun. Have a big party or picnic. The event
should be big to advertise CS and its purpose.
4) Have an informal newsletter which would contain faculty's and
alumnae's thoughts on the past, the present, or the future.
Maybe some anecdotes they wanted to share, but it would be very
informal and in the style of a news article, rather than a
technical paper. This would give people something to take home
and would have under one cover thoughts from many, rather
than just a few, famous and not so famous. Perhaps some
photos would be nice too.
5) Have a day of lectures giving faculty and alumnae's idea
of the future of computing in their fields.
EAF reviewed for us a few similar events held at other
universities. For example at MIT, there were faculty talks
on what each area was doing. At Carnegie-Mellon, there was
a Symposium/Conference and a proceedings covering where CS is
today, written by conference alumnae. Then at another place,
there was just a small gathering of alumanae and previous and
present faculty. These represented large, medium, and small
scale events, respectfully.
It was noted that the Stanford Centenial Committee may be
able to help us since both events are happening about the same time.
We should check with them and also if they may have some funds
to contribute if we can integrate it with their events.
The question of perhaps having it as a fund-raiser either
on a small scale or a larger scale was brought up. Some ways
to raise money might be:
1) $100 a plate dinner.
2) Donate archives of famous professors' files or famous
original listings of programs (i.e. Dendral)
Donate copies of old correspondence that might be of
interest, i.e. Letter of George Forsythe to EAF offering
him the faculty position.
3) Invite executives from local Silcon valley companies to
a nice dinner in which some of our more famous faculty
and alumnae could give short talks about their vision of
the future of computer science. Then perhaps asking for
a generous donation.
Perhaps remind them of how important Stanford was to the
formation of their company. Perhaps have as a theme of
such talks how an idea was germinated, how it became a
practical or theoretical result, and a projection on how
it will effect the future. An example of this, of course,
would be the field of AI.
In summary, I think we all agreed that such a celebration
should both be of substance and be fun. People probably would not
make a long journey just for a party.
We should not mix fund-raising in general, i.e. a yearly
event for fundraising, with fund-raising to cover costs for this
special event. A nominal fee may have to be charged for the dinner.
I think it was agreed by all that it would be a two-day event.
On Friday would be a day of lectures (mini-symposium), and in
the evening would be a fancy dinner.
On Saturday would be a picnic or a luncheon of some kind.
Carolyn Tajnai's name was brought up as a possibility to help
us because of her expertise.
Further discussions will be necessary to firm up plans,
committees will have to be formed, etc. Nils thought the
CSD (G.Wheaton probably) should act as the center point for
communications. Dates suggested would be in Oct. or Nov., 1990.
Another meeting will be set up.
Voy Wiederhold
∂09-Apr-90 0825 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 08:24:58 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27676; Mon, 9 Apr 90 08:25:02 -0700
Date: Mon, 9 Apr 1990 8:25:01 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Tomorrow's faculty lunch
Message-Id: <CMM.0.88.639674701.chandler@Sunburn.Stanford.EDU>
No scheduled guest or topic.......general discussion. Come on down!
∂09-Apr-90 1325 LOGMTC-mailer van Glabbeek student meeting
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 13:25:33 PDT
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA09592; Mon, 9 Apr 90 13:26:23 -0700
Date: Mon, 9 Apr 1990 13:26:22 PDT
From: "Steven M. Nowick" <nowick@Neon.Stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: van Glabbeek student meeting
Message-Id: <CMM.0.88.639692782.nowick@Neon.Stanford.EDU>
There will be a student meeting with faculty candidate Rob van Glabbeek
on Thursday, April 12, from 11:30am-noon in CIS #101. Please feel free
to drop by to discuss research with him.
Note that his Thursday morning talk is in CIS #101 as well,
from 9:30-11:00 a.m.
Steve
∂09-Apr-90 1453 chandler@Sunburn.Stanford.EDU [Gio Wiederhold <gio@sumex-aim.Stanford.EDU> : Faculty lunch topic
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 14:52:53 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15281; Mon, 9 Apr 90 14:52:36 -0700
Date: Mon, 9 Apr 1990 14:52:35 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: [Gio Wiederhold <gio@sumex-aim.Stanford.EDU> : Faculty lunch topic
-- An Engineers degree in Computer Science ]
Message-Id: <CMM.0.88.639697955.chandler@Sunburn.Stanford.EDU>
Return-Path: <gio@sumex-aim.stanford.edu>
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14948; Mon, 9 Apr 90 14:49:16 -0700
Received: by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA28416; Mon, 9 Apr 90 14:51:21 PDT
Date: Mon, 9 Apr 1990 14:51:19 PDT
From: Gio Wiederhold <gio@sumex-aim.Stanford.EDU>
To: chandler@sunburn.stanford.edu
Subject: Faculty lunch topic -- An Engineers degree in Computer Science
Message-Id: <CMM.0.88.639697879.gio@sumex-aim.stanford.edu>
To Faculty of the Computer Science Dept.
This note is a follow-up on a proposal initially discussed November 1986, but
tabled at that time because we were also starting the undergraduate program.
It is still of interest, both in relation to needs in several Cs subdisciplines
and because of the demise of the MS-AI option.
A Vexing problem has been the name, many computer scientists feel that the name
is confusing, as it indeed is. But the issue of the name should not disable
us from offering the option.
This proposal was recommended for adoption at the CSL faculty meeting
of 31 Jan 1989.
Based on feedback from the April 1990 lunch meeting I would like to propose
that a general faculty meeting take on this proposal, perhaps with an initial
limitation of ten students total.
Gio
-------------------------------------------------------------------------------
Proposal for an Engineers Option of the Master's Degree
for Selected Areas of Computer Science
Gio Wiederhold
I propose that we enable ourselves to offer an Engineers degree extension
to the CS Masters degree.
The extension would be offered in selected areas, corresponding to the
defined specializations of the MS degree, based on faculty interest.
Initial areas would likely be Artificial Intelligence, Databases (or more
generally the "Area X", covering Data and Knowledge Bases).
Other likely areas would be in Software Systems and Artificial Intelligence.
No separate committee will be set up. The Master's committee will handle
the students that plan to extend their MS program to the Engineers' option.
DEFINITION:
The School of Engineering defines three components for an Engineers
degree:
1. Courses - no school requirements, but 60 units must be graduate units
in the topic area.
(Note: the School of requires for the MS is at least 45 units)
2. Residence (90 units beyond the B.S., at least 36 at Stanford)
3. An Engineer's thesis, sponsored and evaluated by a single Faculty member.
Bound copies of the thesis are filed with the university.
The specific requirements, taken from the Bulletin, are attached below.
Models for such a program are approximately the CS MS-AI program and the MS
program at MIT. In Europe equivalent degrees are the Diplom-Ingenieur and
the Doctorat 3me rang.
I propose specifically that the course requirements are as defined for that
specialization in our MS program (i.e., 45 units with well-defined
prerequisites and achievements). The same unit and GPA requirements will
apply. Every CS Engineer graduate will hence also obtain a MS degree in CS.
Candidates for the Engineer's degree will further complete an additional
45 units (for a total of 90 units as the residence requirement states),
including the Engineer's thesis, which is likely to cover the majority
of those units. An Engineer's thesis at Stanford is a formal thesis,
but supervised by only one faculty members, and focusing more on a solid piece
of work than on originality.
Admission to the MS program will be a prerequisite for students not
already enrolled in the CS MS program. Admission to the Engineers' option
will require (1) expectation of completion of the MS requirements,
(2) agreement by a named faculty member planning to supervise
the Engineers thesis and, (3) approval by the MS committee.
MOTIVATION :
The motivation is similar to that which led to the Stanford MS-AI program.
1. External need:
There is a demand for students with more experience from advanced
projects that is not satisfied by our current MS program, and for
which a Ph.D. education is excessive.
2. Internal need:
We are undertaking experimental research where not all components are
appropriate for Ph.D. work, but exceed the scope and expectations
associated with project courses, such as CS 393 and CS395.
3. Documentation of achievement:
Those few MS students who currently participate in research
projects gain a considerably higher level of expertise than those
who do not, and the difference should be recognized.
4. Documentation of work performed:
A thesis provides a formal reference to experimental research results,
making it easier to build on such work than the results of current
successful MS projects, whose value is typically lost.
5. Cost:
The cost to the Department should be low. I only expect a modest
number of such students, say less than four, in the database area.
Admission will in effect be limited by our ability to offer support,
all of which comes from research funds. The course requirements
are already set by the MS program. It is up to individual faculty
members to decide whether to accept the supervision of Engineers
candidates.
THE MS-AI PROGRAM:
I do hope that this proposal will continue the spirit of the MS-AI program.
It does present a realignment of the course and project requirements (their
requirements from the earlier Bulletin are attached). It should be noted that
their course and residence requirements are now much less (54 units in 6
quarters at 9 units).
SUMMARY:
The intent is to make this a selective, quality program. Some departments in
the School of Engineering see it as such, for instance Civil Engineering. Some
other departments see an Engineers degree as an escape valve for the Ph.D.
program. This is not our intent. Keeping the requirements solid and simple
will permit us to award Engineers degrees only when it is appropriate.
References A: Engineers requirements per Stanford Bulletin (pp. 16,95).
B: MS-AI requirements per Stanford Bulletin (pp. 135--136).
-------
∂09-Apr-90 1456 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 14:56:15 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15479; Mon, 9 Apr 90 14:56:07 -0700
Date: Mon, 9 Apr 1990 14:56:05 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Tomorrow's faculty lunch
Message-Id: <CMM.0.88.639698165.chandler@Sunburn.Stanford.EDU>
NEWS FLASH!
Tomorrow's faculty lunch will not be a "guestless" general discussion day as
formerly reported.....
Instead Gio Wiederhold will be leading a discussion about the Engineers
degree.
See you all tomorrow.
∂09-Apr-90 1501 @Neon.Stanford.EDU:axwang@Theory.Stanford.EDU AFLB this week
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 15:01:12 PDT
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18092; Mon, 9 Apr 90 14:58:19 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA00416; Mon, 9 Apr 90 14:53:17 -0700
Message-Id: <9004092153.AA00416@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: AFLB this week
Date: Mon, 09 Apr 90 14:53:16 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
The speaker at AFLB this week will be Tomas Feder. AFLB will meet as usual
at 12:00pm on Thursday in MJH 252.
Product Graph Representations
------- ----- ---------------
Tomas Feder
We study a hierarchy of canonical representations of graphs as subgraphs
of cartesian products of graphs. This hierarchy starts with the isometric
representation, includes the 2-isometric representation, and ends with
the cartesian prime factorization. We show that all three representations can
be obtained in O(n m) time using O(m) space, for graphs with n vertices
and m edges. Our algorithms give immediate parallel versions that use
n↑3 processors and run in O(log↑2 n) time.
∂09-Apr-90 2328 LOGMTC-mailer test message
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 Apr 90 23:28:11 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25593; Mon, 9 Apr 90 23:29:01 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA07408; Mon, 9 Apr 90 23:29:07 PDT
Date: Mon, 9 Apr 90 23:29:07 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9004100629.AA07408@coraki.stanford.edu>
To: logic@cs.Stanford.EDU
Subject: test message
This test message is being sent to logic@cs. If you are on logmtc@sail
you should receive it.
-v
∂10-Apr-90 0840 chandler@Sunburn.Stanford.EDU Women in Computer Science
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 08:40:20 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA28646; Tue, 10 Apr 90 08:22:18 -0700
Date: Tue, 10 Apr 1990 8:22:18 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: csdlist@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Women in Computer Science
Message-Id: <CMM.0.88.639760938.chandler@Sunburn.Stanford.EDU>
I have a copy of "Women in Computer Science...A Report for the NSF CISE Cross
Disciplinary Activities Advisory Committee" by Professor Nancy Leveson of
UC-Irvine. You are welcome to borrow it if you wish.
∂10-Apr-90 0857 littell@Sunburn.Stanford.EDU Fellowship supplement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 08:57:00 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA29466; Tue, 10 Apr 90 08:57:46 -0700
Date: Tue, 10 Apr 90 08:57:46 -0700
From: Angelina M. Littell <littell@Sunburn.Stanford.EDU>
Message-Id: <9004101557.AA29466@Sunburn.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU, clt@cs.Stanford.EDU
Cc: littell@Sunburn.Stanford.EDU
Subject: Fellowship supplement
John,
I am working on fellowship supplements for Spring quarter. I have Ramin Zabih
as working for you for spring quarter. Will you be supporting his supplement
for this quarter? If so, what account should I charge it to? His supplement
amount is $287.33. Please inform.
THanks.
--Angie
∂10-Apr-90 0903 chandler@Sunburn.Stanford.EDU I have received....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 09:03:14 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA29634; Tue, 10 Apr 90 09:03:26 -0700
Date: Tue, 10 Apr 1990 9:03:25 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: I have received....
Message-Id: <CMM.0.88.639763405.chandler@Sunburn.Stanford.EDU>
some information from Prentice Hall Publishers regarding ordering examination
copies of their publications by electronic mail. If you are interested in
seeing this info please let me know. Thanks much.
∂10-Apr-90 0936 ZM
\chapter{{}: Related\\Textbooks:\\a Selection}
\def\rhead{Related Textbooks}
\mark{\rhead}
% This is a hack! We want to make the small caps font to have a slightly
% smaller space in this font. Yuck.
% There is also one more line at the bottom of this page!
\begingroup
% Starthack
\newdimen\oldscskip
\oldscskip = \fontdimen 2\scfont
\fontdimen 2\scfont = \fontdimen 2\tenrm
% Endhack
\parindent = 0pt
\everypar{\hangindent = 20pt}
\def\head{\begingroup \noindent
\hangindent = 0pt \rightskip = 20pt \leftskip = 20pt
\def\par{\endgraf \endgroup \nobreak}}
\head
Introductions to logic from a mathematical point of view,
with no computational emphasis:
{\sc A. Church}, {\ic Introduction to Mathematical Logic}.
Princeton: Princeton University Press, 1956.
{\sc H.$\,$B. Enderton}, {\ic A Mathematical Introduction to Logic}.
New York: Academic Press, 1972.
{\sc S.$\,$C.\ Kleene}, {\ic Mathematical Logic}. New York: John Wiley
and Sons, 1967.
{\sc E.\ Mendelson}, {\ic Introduction to Mathematical Logic}.
New York: D.\ Van Nostrand, 1964.
\bigskip
\head
More popular and informal introductions to logic:
{\sc D.$\,$R.\ Hofstadter}, {\ic G\"odel, Escher, Bach: An Eternal
Golden Braid}. New York: Basic Books, 1979.
{\sc R.\ Smullyan}, {\ic What Is the Name of This Book?} Englewood
Cliffs, N.\kern 3.333pt J.: Prentice-Hall, 1978.
\bigskip
\head
Introductions to automatic theorem proving:
{\sc R.$\,$S.\ Boyer} and {\sc J S.\ Moore}, {\ic A Computational Logic}.
New York: Academic Press, 1979.
{\sc C.$\,$L.\ Chang} and {\sc R.$\,$C.$\,$T.\ Lee}, {\ic Symbolic Logic and
Mechanical Theorem Proving}. New York: Academic Press, 1973.
{\sc D.$\,$W.\ Loveland}, {\ic Automated Theorem Proving: A Logical Basis}.
Amsterdam: North-Holland, 1978.
{\sc J.$\,$A.\ Robinson}, {\ic Logic: Form and Function}. New York:
North-Holland, 1979.
{\sc L.\ Wos}, {\sc R.\ Overbeek}, {\sc E.\ Lusk}, and {\sc J.\ Boyle},
{\ic Automated Reasoning: Introduction and Application}. Englewood Cliffs,
N.\ J.: Prentice-Hall, 1984.
\bigskip
\head
Texts relating logic to the theory of computation:
{\sc H.$\,$R.\ Lewis} and {\sc C.$\,$H.\ Papadimitriou}, {\ic Elements of the
Theory of Computation}. Englewood Cliffs, N.\ J: Prentice-Hall, 1981.
{\sc Z.\ Manna}, {\ic Mathematical Theory of Computation}.
New York: McGraw-Hill, 1974.
\bigskip
\head
Books applying logic to the construction of correct computer
programs:
{\sc R.$\,$L.\ Constable} and {\sc M.$\,$J.\ O'Donnell}, {\ic A Programming
Logic}. Cambridge, Mass.: Winthrop, 1978.
{\sc E.$\,$W.\ Dijkstra}, {\ic A Discipline of Programming}. Englewood
Cliffs, N.\ J.: Prentice-Hall, 1976.
{\sc D.\ Gries}, {\ic The Science of Programming}. New York:
Springer-Verlag, 1981.
{\sc J.$\,$C.\ Reynolds}, {\ic The Craft of Programming}. Englewood Cliffs,
N.\ J.:
Prentice-Hall International, 1981.
{\sc M.\ Wand}, {\ic Induction, Recursion, and Programming}. New
York: North-Holland, 1980.
\bigskip
\head
Texts applying logical techniques to problem solving and
other topics in artificial intelligence:
{\sc R.\ Kowalski}, {\ic Logic for Problem Solving}. New York:
North Holland, 1979.
{\sc N.$\,$J.\ Nilsson}, {\ic Principles of Artificial Intelligence}.
Palo Alto, Calif.: Tioga, 1980.
\bigskip
\head
Introductions to the logically oriented programming languages
{\sc lisp} and {\sc prolog}:
{\sc W.$\,$F.\ Clocksin} and {\sc C.$\,$S.\ Mellish}, {\ic Programming in
Prolog}. Berlin: Springer-Verlag, 1981.
{\sc P.$\,$H.\ Winston} and {\sc B.$\,$K.$\,$P.\ Horn}, {\ic LISP}. Reading,
Mass.: Addison-Wesley, 1981.
{\sc W.$\,$A.\ Wolf, M.\ Shaw, P.$\,$N.\ Hilfinger}, and {\sc L.\ Flon},
{\ic Fundamental Structures of Computer Science}, Reading, Mass.:
Addison-Wesley, 1981.
% Let's repatch up \scfont before we do too much damage!
\fontdimen 2\scfont = \oldscskip
\endgroup
∂10-Apr-90 0937 ZM
\chapter{{}: References:\\A Selection}
\def\rhead{References}
% This is a hack! We want to make the small caps font to have a slightly
% smaller space in this font. Yuck.
% There is also one more line at the bottom of this page!
\indent We make no attempt to give a complete survey of the literature. Rather,
we include only a selection of reference books and a few technical papers, which
will provide further information on the topics included in this volume.
\bigbreak
\mark{\rhead}
\begingroup
% Starthack
\newdimen\oldscskip
\oldscskip = \fontdimen 2\scfont
\fontdimen 2\scfont = \fontdimen 2\tenrm
% Endhack
\parindent = 0pt
%\everypar{\hangindent = 20pt}
%\def\head{\begingroup \noindent
% \hangindent = 0pt \rightskip = 20pt \leftskip = 20pt
% \def\par{\endgraf \endgroup \nobreak}}
\Ipar Introductions to mathematical logic that are oriented toward automated
deduction or associated topics:
{\sc P.$\,$B.\ Andrews}, {\ic An Introduction to Mathematical Logic and
Type Theory: To Truth through Proof}. Orlando, Florida: Academic Press, 1986.
Includes higher-order logic, in which one can quantify over relations and
functions as well as over domain elements.
{\sc C.$\,$L.\ Chang} and {\sc R.$\,$C.$\,$T.\ Lee}, {\ic Symbolic Logic and
Mechanical Theorem Proving}. New York: Academic Press, 1973. A clear,
classical treatment of resolution theorem proving and its extensions.
{\sc H.$\,$B.\ Enderton}, {\ic Elements of Set Theory}. New York: Academic
Press, 1977. Includes a discussion of well-founded relations and well-founded
induction.
{\sc J.$\,$H.\ Gallier}, {\ic Logic for Computer Science: Foundations
of Automatic Theorem Proving}.
New York: Harper and Row, 1986.
Especially good on the relation between theorem proving and conventional
deduction systems.
{\sc D.$\,$W.\ Loveland}, {\ic Automated Theorem Proving: A Logical Basis}.
New York: North-Holland, 1978.
A thorough treatment of (primarily) resolution theorem proving.
{\sc J.$\,$A.\ Robinson}, {\ic Logic: Form and Function. The
Mechanization of Deductive Reasoning}.
New York: North-Holland, 1979. An
introduction to automated deduction emphasizing resolution and its extensions.
{\sc L.\ Wos, R.\ Overbeek, E.\ Lusk}, and {J.\ Boyle}, {\ic Automated Reasoning:
Introduction and Applications}, Englewood Cliffs, New Jersey: Prentice-Hall,
1984. Special emphasis on the implementation and strategic aspects of
resolution theorem proving.
\medbreak
\Ipar
Introductions to automated reasoning emphasizing nonresolution approaches:
{\sc R.$\,$S.\ Boyer} and {\sc J S.\ Moore}, {\ic A Computational Logic}.
New York: Academic Press, 1979. A complete description of a well-known
theorem-proving system, which can do proofs using mathematical induction.
{\sc A.\ Bundy}, {\ic The Computer Modelling of Mathematical Reasoning}.
London: Academic Press, 1983. Includes methods based on rewriting.
%\bigskip
\medbreak
\Ipar
Decidability, computability, and completeness issues:
{\sc H.$\,$B.\ Enderton}, {\ic A Mathematical Introduction to Logic}.
New York: Academic Press, 1972. Includes a good discussion of nonstandard models.
{\sc E.$\,$Mendelson}, {\ic Introduction to Mathematical Logic}.
Monterey, California: Wads\-worth and Brooks, 1987. Includes a full treatment of
undecidability.
{\sc H.\ Rogers, Jr.}, {\ic Theory of Recursive Functions and Effective
Computability}. New York: McGraw-Hill, 1967. A thorough treatment of which
functions can and cannot be computed mechanically.
%\bigskip
\medbreak
\Ipar
Application of automated deduction to artificial intelligence and
program synthesis:
{\sc M.$\,$R.\ Genesereth} and {\sc N.$\,$ J.\ Nilsson}, {\ic Logical
Foundations of Artificial Intelligence}. Los Altos, California:
Morgan Kaufmann, 1987. Includes reasoning about knowledge and belief
and probabilistic reasoning.
{\sc R.\ Kowalski}, {\ic Logic for Problem Solving}. New York: North Holland,
1979. Includes relationship with logic programming.
{\sc Z.\ Manna} and {\sc R.\ Waldinger}, The Origin of a Binary-Search
Paradigm. {\ic Science of Computer Programming} 9 (1987) 37--83.
Extension of the deductive-tableau system to the derivation of programs.
%\bigskip
\medbreak
\Ipar
Historical references:
{\sc T.\ Skolem}, Logisch-kombinatorische Untersuchungen \"uber die
Erf\"ullbarkeit oder Beweisbarkeit Mathematischer S\"atze nebst einem Theorem
\"uber Dichte Mengen. {\ic Videnskopsselskapits skifter}, I. {\ic
Matematik-Naturvidenskabelig Klasse} 4 (1920). English translation,
Logico-Combinatorial Investigations in the Satisfiability or Provability of
Mathematical Propositions: A Simplified Proof of a Theorem by L.\ L\"owenheim
and Generalizations of the Theorem. In van Heijenoort [1967].
Introduces the notion of skolemization.
{\sc J.\ Herbrand}, {\ic Recherches sur la Th\'eorie de la D\'emonstration}.
Ph.D.\ dissertation, University of Paris, Paris, 1930. Introduces the
notion of unification and several other ideas influential in theorem proving.
{\sc K.\ G\"odel}, \"Uber Formal Unentscheidbare S\"atze der Principia
Mathematica und Verwandter Systeme I, {\ic Monatschefte f\"ur Mathematik und
Physik}
38 (1931), 173--198. English translation, On Formally Undecidable
Propositions of Principia Mathematica and Related Systems. In van Heijenoort
[1967]. Establishes the incompleteness of the theory of nonnegative integers.
{\sc E.\ Zermelo}, Grundlagen einer Allgemeinen Theorie der Mathematischen
Satzsysteme.\ {\ic Fundamenta Mathematicae}\ 25 (1935) 136--146. Introduces the notion of a
well-founded relation.
{\sc A.\ Church}, A Note on the Entscheidungsproblem, {\ic Journal of
Symbolic Logic} 1 (1936) 40--41. Correction 101--102. Establishes the
undecidability of predicate logic.
{\sc J.\ van Heijenoort} (editor), {\ic From Frege to G\"odel}. Cambridge,
Massachusetts: Harvard Univesity Press, 1967.
A collection of classical papers in mathematical logic.
{\sc J.\ Siekmann} and {\sc G.\ Wrightson}, {\ic Automation of Reasoning 1:
Classical Papers on Computational Logic 1957--1966}. Berlin: Springer-Verlag,
1983. A collection of early theorem-proving papers.
{\sc J.$\,$A.\ Robinson}, A Machine-oriented Logic Based on the
Resolution Principle, {\ic Journal of the ACM} 12 (1965) 23--41. Introduces the
resolution rule.
%\bigskip
\medbreak
\Ipar
Papers that provide theoretical background for this book:
{\sc Z.\ Manna} and {\sc R.\ Waldinger}, A Deductive Approach to
Program Synthesis, {\ic ACM Transactions on Programming Languages and Systems}
2 (1980) 90--121. Introduces nonclausal resolution and applies it to
program synthesis.
{\sc N.\ Murray}, Completely Nonclausal Theorem Proving,
{\ic Artificial Intelligence} 18 (1) 1982, 67--85.
Introduces nonclausal resolution independently from Manna and Waldinger
[1980] and establishes its completeness for predicate logic.
{\sc J.\ Hsiang} and {\sc M.\ Rusinowitch}, A New Method for Establishing
Refutational Completeness in Theorem Proving, {\ic Eighth International
Conference on Automated Deduction}. Berlin: Springer-Verlag, 1986, 141--152.
Establishes the completeness of the resolution and equality rules for the
theory of equality.
% Let's repatch up \scfont before we do too much damage!
\fontdimen 2\scfont = \oldscskip
\endgroup
\bye
∂10-Apr-90 0938 ZM
\chapter{{}: References:\\a\\Selection}
\def\rhead{References}
% This is a hack! We want to make the small caps font to have a slightly
% smaller space in this font. Yuck.
% There is also one more line at the bottom of this page!
\indent We make no attempt to give a complete survey of the literature. Rather we
include only a selection of reference books and a few technical papers, which
will provide further information on the topics included in this volume.
\mark{\rhead}
\begingroup
% Starthack
\newdimen\oldscskip
\oldscskip = \fontdimen 2\scfont
\fontdimen 2\scfont = \fontdimen 2\tenrm
% Endhack
\parindent = 0pt
\everypar{\hangindent = 20pt}
\def\head{\begingroup \noindent
\hangindent = 0pt \rightskip = 20pt \leftskip = 20pt
\def\par{\endgraf \endgroup \nobreak}}
\head
\indent Introductions to mathematical logic that are oriented toward automated
deduction:
{\sc P.$\,$B.\ Andrews}, {\ic An Introduction to Mathematical Logic and
Type Theory: To Truth Through Proof}. Orlando, Florida: Academic Press, 1986.
Includes higher-order logic, in which one can quantify over relations and
functions as well as over domain elements.
{\sc C.$\,$L.\ Chang} and {\sc R.$\,$C.$\,$T.\ Lee}, {\ic Symbolic Logic and
Mechanical Theorem Proving}. New York: Academic Press, 1973. A clear,
classical treatment of resolution theorem proving and its extensions.
{\sc J.$\,$H.\ Gallier}, {\ic Logic for Computer Science: Foundations
of Automatic Theorem Proving}.
New York: Harper and Row, 1986.
Specially good on the relation between theorem proving and conventional
deduction systems.
{\sc D.$\,$W.\ Loveland}, {\ic Automated Theorem Proving: A Logical Basis}.
New York: North-Holland, 1978.
A thorough treatment of (primarily) resolution theorem proving.
{\sc J.$\,$A.\ Robinson}, {\ic Logic: Form and Function: The
Mechanization of Deductive Reasoning}.
New York: North-Holland, 1979. An
introduction to automated deduction emphasizing resolution and its extensions.
{\sc L.\ Wos, R.\ Overbeek, E.\ Lusk, J.\ Boyle}, {\ic Automated Reasoning:
Introduction and Applications}, Englewood Cliffs, New Jersey: Prentice-Hall,
1984. Special emphasis on the implementation and strategic aspects of
resolution theorem proving.
\bigskip
\head
Introductions to automated reasoning emphasizing nonresolution approaches:
{\sc R.$\,$S.\ Boyer} and {\sc J S.\ Moore}, {\ic A Computational Logic}.
New York: Academic Press, 1979. A complete description of a well-known
theorem-proving system, which can do proofs using mathematical induction.
{\sc A.\ Bundy}, {\ic The Computer Modelling of Mathematical Reasoning}.
London: Academic Press, 1983. Includes methods based on rewriting.
\bigskip
\head
Decidability, Computability, and Completeness issues:
{\sc H.$\,$B.\ Enderton}, {\ic A Mathematical Introduction to Logic}.
New York: Academic Press, 1972. Includes a good discussion of nonstandard models.
{\sc S.$\,$C.\ Kleene}, {\ic Mathematical Logic},
New York: John Wiley and Sons, 1967. Includes a full treatment of undecidability
and incompleteness.
{\sc H.\ Rogers, Jr.}, {\ic Theory of Recursive Functions and Effective
Computability}. New York: McGraw-Hill, 1967. A thorough treatment of which
functions can and cannot be computed mechanically.
\bigskip
\head
Application of automated deduction to artificial intelligence and
program synthesis:
{\sc M.$\,$R.\ Genesereth} and {\sc N.$\,$ J.\ Nilsson}, {\ic Logical
Foundations of Artificial Intelligence}, Los Altos, California:
Morgan Kaufmann, 1987. Includes reasoning about knowledge and belief
and probabilistic reasoning.
{\sc R.\ Kowalski}, {\ic Logic for Problem Solving}. New York: North Holland,
1979. Includes relationship with logic programming.
{\sc Z.\ Manna} and {\sc R.\ Waldinger}, The Origin of a Binary-Search
Paradigm, {\ic Science of Computer Programming} 9 (1987) 37--83.
Extension of the deductive tableau system to the derivation of programs.
%move ``skolem'' reference here
\bigskip
\head
Historical references:
{\sc T.\ Skolem}, Logisch-kombinatorische Untersuchungen \"uber die
Erf\"ullbarkeit oder Beweisbarkeit Mathematischer S\"atze nebst einem Theorem
\"uber Dichte Mengen. {\ic Videnskopsselskapits skifter}, I. {\ic
Matematik-naturvidenskabelig klasse}, 4 (1920). English translation,
Logico-Combinatorial Investigations in the Satisfiability or Provability of
Mathematical Propositions: A Simplified Proof of a Theorem by L.\ L\"owenheim
and Generalizations of the Theorem, in van Heijenoort [1967].
Introduces the notion of skolemization.
{\sc J.\ Herbrand}, {\ic Recherches sur la Th\'eorie de la D\'emonstration}.
Ph.D.\ dissertation, University of Paris, Paris, 1930. Introduces the
notion of unification and several other ideas influential in theorem proving.
{\sc K.\ G\"odel}, \"Uber Formal Unentscheidbare S\"atze der Principia
Mathematica und Verwandter Systeme I, {\ic Monatschefte f.\ Math.\ u.\ Phys.}
38 (1931), 173--198. English translation, On Formally Undecidable
Propositions of Principia Mathematica and Related Systems, in van Heijenoort
[1967]. Establishes the incompleteness of the theory of nonnegative integers.
{\sc J.\ van Heijenoort} (editor) {\ic From Frege to G\"odel}. Cambridge,
Massachussetts: Harvard Univesity Press, 1967.
A collection of classical papers in mathematical logic.
{\sc J.$\,$A.\ Robinson}, A Machine-Oriented Logic Based on the
Resolution Principle, {\ic Journal of the ACM}, 12 (1965) 23--41. Introduces the
resolution rule.
{\sc J.\ Siekmann} and {\sc G.\ Wrightson}, {\ic Automation of Reasoning 1:
Classical Papers on Computational Logic 1957-1966}. Berlin: Springer-Verlag,
1983. A collection of early theorem-proving papers.
\bigskip
\head
Papers that provide theoretical background for this book:
{\sc Z.\ Manna} and {\sc R.\ Waldinger}, A Deductive Approach to
Program Synthesis, {\ic ACM Transactions on Programming Languages and Systems}
2 (1980) 90--121. Introduces nonclausal resolution and applies it to
program synthesis.
{\sc N.\ Murray}, Completely Nonclausal Theorem Proving,
{\ic Artificial Intelligence} 18 (1) 1982, 67--85.
Introduces nonclausal resolution independently from Manna and Waldinger
[1980] and establishes its completeness for predicate logic.
{\sc J.\ Hsiang} and {\sc M.\ Rusinowitch}, A New Method for Establishing
Refutational Completeness in Theorem Proving, 8$↑{th}$ {\ic International
Conference on Automated Deduction}. Berlin: Springer-Verlag, 1986, pp.\ 141--152.
Establishes the completeness of the resolution and equality rules for the
theory of equality.
% Let's repatch up \scfont before we do too much damage!
\fontdimen 2\scfont = \oldscskip
\endgroup
\bye
∂10-Apr-90 1220 saraswat@cascade.Stanford.EDU EE 310 Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 12:20:31 PDT
Received: from cascade.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Tue, 10 Apr 90 12:16:35 PDT
Received: by cascade.Stanford.EDU (5.57/Ultrix2.4-C)
id AA05205; Tue, 10 Apr 90 12:14:25 PDT
Date: Tue, 10 Apr 90 12:14:25 PDT
From: saraswat@cascade.stanford.edu (Krishna Saraswat)
Message-Id: <9004101914.AA05205@cascade.Stanford.EDU>
To: cis-people@glacier.Stanford.EDU, ee-faculty@sierra.Stanford.EDU
Subject: EE 310 Seminar
EE 310 SEMINAR
ON: SPEEDIE: Stanford Profile Emulator for Deposition & Etching in IC
Engineering
BY: James MvVittie, CIS, Stanford University
IN: McCullough 128
ON: April 10, 1990
AT: 4:15 P.M.
∂10-Apr-90 1322 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 13:22:45 PDT
Received: from CIS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06248; Tue, 10 Apr 90 13:22:29 -0700
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA01214; Tue, 10 Apr 90 13:21:15 PDT
Date: Tue, 10 Apr 90 13:21:15 PDT
From: marty@cis.Stanford.EDU (Marty Tenenbaum)
Message-Id: <9004102021.AA01214@cis.Stanford.EDU>
To: chandler@sunburn.stanford.edu
Cc: faculty@cs.stanford.edu, chandler@sunburn.stanford.edu
In-Reply-To: "Joyce R. Chandler"'s message of Fri, 6 Apr 1990 14:12:00 PDT <CMM.0.88.639436320.chandler@Sunburn.Stanford.EDU>
Subject: Publication
please send me a copy of NSF Software Capitalization Grants.
JMT.
∂10-Apr-90 1326 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU I have received....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 13:26:25 PDT
Received: from CIS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06392; Tue, 10 Apr 90 13:25:58 -0700
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA01225; Tue, 10 Apr 90 13:24:43 PDT
Date: Tue, 10 Apr 90 13:24:43 PDT
From: marty@cis.Stanford.EDU (Marty Tenenbaum)
Message-Id: <9004102024.AA01225@cis.Stanford.EDU>
To: chandler@sunburn.stanford.edu
Cc: faculty@cs.stanford.edu, chandler@sunburn.stanford.edu
In-Reply-To: "Joyce R. Chandler"'s message of Tue, 10 Apr 1990 9:03:25 PDT <CMM.0.88.639763405.chandler@Sunburn.Stanford.EDU>
Subject: I have received....
please send me prentice hall email blurb.
JMT.
∂10-Apr-90 1649 ingrid@russell.Stanford.EDU CSLI Colloquium on 4/12 - change of location
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 16:49:48 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA27659; Tue, 10 Apr 90 16:28:39 PDT
Date: Tue, 10 Apr 90 16:28:39 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004102328.AA27659@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Colloquium on 4/12 - change of location
Please note the change of location for this week's CSLI Colloquium:
Precompiled Syntactic Constraints for Continuous
Speech Recognition
Pierre Dupont
Philips Research Laboratory, Brussels
(dupont@prlb.philips.be)
Thursday, 12 April, 4:15 p.m.
Cordura 100
∂10-Apr-90 1950 vivluo@Sunburn.Stanford.EDU Please mark your calendars
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 19:50:34 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15520; Tue, 10 Apr 90 19:50:36 -0700
Date: Tue, 10 Apr 1990 19:50:35 PDT
From: Vivian Luo <vivluo@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: Please mark your calendars
Message-Id: <CMM.0.88.639802235.vivluo@Sunburn.Stanford.EDU>
Dear CS Faculty,
You are invited to attend the
Undergraduate CS Lunch Social
Wednesday, May 2
at Noon
location TBA
Details later. Please mark your calendars now!
-vivian
∂10-Apr-90 2332 grundy@csli.Stanford.EDU Final Symbolic Systems Forum Schedule
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 Apr 90 23:32:48 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA09203; Tue, 10 Apr 90 23:28:00 PDT
Date: Tue 10 Apr 90 23:27:59-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Final Symbolic Systems Forum Schedule
To: grundy@csli.Stanford.EDU
Message-Id: <639818879.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
THE SYMBOLIC SYSTEMS FORUM
Schedule for Spring Quarter, 1990
The Symbolic Systems Forum meets every Thursday
at 4:15 pm in building 60, room 61G.
April 12
Peter Cheeseman, NASA Ames Research Center
"The General Theory of Induction"
April 19
Stanley Peters, Linguistics, Director of CSLI
"Overview of Research at the Center for the Study of
Language and Information"
NOTE: The April 19 forum will include a tour of the
facilities at CSLI. Therefore, we will NOT meet in
building 60; instead, we will meet at CSLI, in Cordura
Hall, room 100 (the conference room). Cordura Hall is
located on the corner of Campus Drive and Panama
Street.
April 26
Jon Barwise, Philosophy
"Applications of Non-wellfounded Sets in Symbolic
Systems"
May 3
Ben Libet, Physiology, UC San Francisco
"The Neurophysiology of Conscious Experience"
May 10
Bernardo Huberman, Applied Physics
"The Problem of Idle Time"
May 17
Rene Girard, French
"The Genesis of Symbolic Forms in Human Culture"
May 24
Jean-Pierre Dupuy, French
"On the Self-deconstruction of the Symbolic Order"
May 31
Seniors in the Symbolic Systems Program honors program
present their work.
Refreshments are served every week at the forum.
If you would like to be added to the Symbolic Systems Forum
electronic mailing list, send a note to Bill Grundy at
grundy@csli.stanford.edu.
-------
∂11-Apr-90 0905 @Sunburn.Stanford.EDU:ejm@shasta.Stanford.EDU Re: Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 09:05:28 PDT
Received: from shasta.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21584; Wed, 11 Apr 90 09:05:25 -0700
Received: by shasta.Stanford.EDU (5.57/4.7); Wed, 11 Apr 90 08:51:16 PDT
Date: Wed, 11 Apr 1990 8:51:14 PDT
From: Ed McCluskey <ejm@shasta.Stanford.EDU>
To: marty@cis.Stanford.EDU (Marty Tenenbaum)
Cc: chandler@sunburn.stanford.edu, faculty@cs.stanford.edu,
chandler@sunburn.stanford.edu
Subject: Re: Publication
In-Reply-To: Your message of Tue, 10 Apr 90 13:21:15 PDT
Message-Id: <CMM.0.88.639849074.ejm@shasta.Stanford.EDU>
> please send me a copy of NSF Software Capitalization Grants.
>
> JMT.
>
>
I don"t have any such thing
What else can I do to help
Ed
∂11-Apr-90 0906 @Sunburn.Stanford.EDU:ejm@shasta.Stanford.EDU Re: I have received....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 09:05:55 PDT
Received: from shasta.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21583; Wed, 11 Apr 90 09:05:25 -0700
Received: by shasta.Stanford.EDU (5.57/4.7); Wed, 11 Apr 90 08:51:58 PDT
Date: Wed, 11 Apr 1990 8:51:57 PDT
From: Ed McCluskey <ejm@shasta.Stanford.EDU>
To: marty@cis.Stanford.EDU (Marty Tenenbaum)
Cc: chandler@sunburn.stanford.edu, faculty@cs.stanford.edu,
chandler@sunburn.stanford.edu
Subject: Re: I have received....
In-Reply-To: Your message of Tue, 10 Apr 90 13:24:43 PDT
Message-Id: <CMM.0.88.639849117.ejm@shasta.Stanford.EDU>
> please send me prentice hall email blurb.
>
> JMT.
>
>
don't have this either, but nice to know that you are interested
∂11-Apr-90 1122 LOGMTC-mailer Seminar in Logic and Foundations
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 11:22:33 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA25295; Wed, 11 Apr 90 11:24:40 PDT
Date: Wed, 11 Apr 1990 11:24:39 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.639858279.sf@csli.stanford.edu>
There will be no seminar meeting on Monday April 16. Next meeting will
be on Monday April 23 (speaker, Yuri Matijasevich, title to be announced).
Raymond Smullyan is scheduled to give the de Leeuw Memorial Lecture on
Monday April 30 at 4:15 (details to follow). The second seminar talk
by Yuri Matijasevich will be rescheduled to Tues or Wed of that week.
∂11-Apr-90 1604 @Sunburn.Stanford.EDU:gio@sumex-aim.stanford.edu Engineer's degree
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 16:04:15 PDT
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04927; Wed, 11 Apr 90 16:04:02 -0700
Received: by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA26220; Wed, 11 Apr 90 16:06:12 PDT
Date: Wed, 11 Apr 1990 16:06:10 PDT
From: Gio Wiederhold <gio@sumex-aim.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Engineer's degree
Message-Id: <CMM.0.88.639875170.gio@sumex-aim.stanford.edu>
Fellow CSers,
Here is my summary from yesterdays's faculty lunch discussion, and some
subsequent comments.
1. Ed Feigenbaum suggested the title
`Masters(Honors), providing a University Engineers degree'.
That seems fine.
2. Everybody seems to be for the program, as long as it is:
a. small scale
b. pendent on faculty acceptance of individual student supervision.
3. However the cost benefit ratio can be argued to be poor for the students.
This is largely due to the 90 units School of Engineering requirement for an
Engineer's degree and the 9 unit unit limit for supported students (see orig.
memo). The University requirement, MS plus 36 units (i.e.. in CS 42+36=78)
units seems more tolerable, but is still high.
The following residence times accrue under various cases:
----- quarters at Stanford -----
Current MS, old MS AI, Honors 78, 90 units
---- ---- ---- ----
1. All self supported at 12 units 3.5 not normal 6.5 7.5
2. All self supported at 14 units 3.0 not normal 5.6 6.4
3. Fully TA/RA supported 4.8 6.0 8.7 10.0 *
(9 unit limitation)
4. First 9 months self supported, 4.0 not normally 7.7 9.0 *
RA support while doing the done -----
degree research
The two *-marked alternatives seem to be excessive, i.e., have a poor
cost-benefit. The underlined choice is feasible, since it ammounts to two
years residence if summers are spent here doing research. How easy it is
to convince the School of Engineering to go with the University rules for our
program I can't tell.
An alternative is to decouple the the Master(Honors) from the Engineers degree.
Then we can set our own standards, likely at about 78 units. Students wishing
to file a University Engineers thesis might still have that option at the cost
of satisfying the 90 unit criterion as well.
Comments?
Gio
<ps circulation of this note and the propsal among students is encouraged>
∂11-Apr-90 1628 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Dinner with Rob van Glabbeek
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 16:28:07 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05513; Wed, 11 Apr 90 16:27:46 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA02284; Wed, 11 Apr 90 16:27:45 PDT
Date: Wed, 11 Apr 90 16:27:45 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9004112327.AA02284@coraki.stanford.edu>
To: csl-faculty@sierra.Stanford.EDU, faculty@cs.Stanford.EDU
Subject: Dinner with Rob van Glabbeek
Rob van Glabbeek will be interviewing here tomorrow for the software
systems search. I will be taking him to dinner in the evening. Please
let me know if you would like to join us.
Also a reminder that his talk will be at 9:30 in CIS-101 tomorrow
morning (Thursday). In addition he will give a talk at 10:00 on Friday
morning, in MJ301.
Titles are as follows.
Thursday April 12, 9:30-11:00, CIS-101
Title: Comparative Concurrency Semantics
In this talk I compare the semantic equivalences that are induced by
various models of concurrency. I discuss some criteria that may be
imposed on these equivalences, such as
- full abstraction w.r.t testing notions,
- preservation of the causal and branching structure of concurrent systems,
- real-time consistency,
- preservation under refinement of actions,
- a low complexity for finite-state systems,
and try to establish which equivalences satisfy which criteria.
========================
Friday April 13, 10:00, MJH-301
Title: Petri nets, Configuration Structures, and Process Graphs
In Nielsen, Plotkin & Winskel (1981) event structures were introduced
to give a representation of (unlabeled) safe Petri nets that abstracts
from the places in these nets, and to connect Petri nets with Scott
domains. In later work of Winskel, event structures were generalized
several times to capture more features of concurrency. In this talk I
propose `configuration structures' as a further generalization of event
structures, that is expressive enough to give a representation of
labeled Petri nets (that are not required to be safe) without losing
anything of their causal structure. History preserving process graphs
are introduced to play the role of domains in this general setting.
∂11-Apr-90 1628 LOGMTC-mailer Van Glabeek talks--reminder
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 16:28:41 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05593; Wed, 11 Apr 90 16:29:29 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA02301; Wed, 11 Apr 90 16:29:35 PDT
Date: Wed, 11 Apr 90 16:29:35 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9004112329.AA02301@coraki.stanford.edu>
To: logic@cs.Stanford.EDU
Subject: Van Glabeek talks--reminder
Cc: aflb-all@cs.Stanford.EDU, su-events@cs.Stanford.EDU
A reminder that Rob van Glabbeek, of CWI and the University of
Amsterdam, will be visiting us on Thursday and Friday. He will give the
following talks.
Thursday April 12, 9:30-11:00, CIS-101
Title: Comparative Concurrency Semantics
In this talk I compare the semantic equivalences that are induced by
various models of concurrency. I discuss some criteria that may be
imposed on these equivalences, such as
- full abstraction w.r.t testing notions,
- preservation of the causal and branching structure of concurrent
systems,
- real-time consistency,
- preservation under refinement of actions,
- a low complexity for finite-state systems,
and try to establish which equivalences satisfy which criteria.
========================
Friday April 13, 10:00, MJH-301
Title: Petri nets, Configuration Structures, and Process Graphs
In Nielsen, Plotkin & Winskel (1981) event structures were introduced
to give a representation of (unlabeled) safe Petri nets that abstracts
from the places in these nets, and to connect Petri nets with Scott
domains. In later work of Winskel, event structures were generalized
several times to capture more features of concurrency. In this talk I
propose `configuration structures' as a further generalization of event
structures, that is expressive enough to give a representation of
labeled Petri nets (that are not required to be safe) without losing
anything of their causal structure. History preserving process graphs
are introduced to play the role of domains in this general setting.
∂11-Apr-90 1631 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Van Glabeek talks--reminder
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 16:31:39 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA09637; Wed, 11 Apr 90 16:29:38 -0700
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05593; Wed, 11 Apr 90 16:29:29 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA02301; Wed, 11 Apr 90 16:29:35 PDT
Date: Wed, 11 Apr 90 16:29:35 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9004112329.AA02301@coraki.stanford.edu>
To: logic@cs.Stanford.EDU
Subject: Van Glabeek talks--reminder
Cc: aflb-all@cs.Stanford.EDU, su-events@cs.Stanford.EDU
A reminder that Rob van Glabbeek, of CWI and the University of
Amsterdam, will be visiting us on Thursday and Friday. He will give the
following talks.
Thursday April 12, 9:30-11:00, CIS-101
Title: Comparative Concurrency Semantics
In this talk I compare the semantic equivalences that are induced by
various models of concurrency. I discuss some criteria that may be
imposed on these equivalences, such as
- full abstraction w.r.t testing notions,
- preservation of the causal and branching structure of concurrent
systems,
- real-time consistency,
- preservation under refinement of actions,
- a low complexity for finite-state systems,
and try to establish which equivalences satisfy which criteria.
========================
Friday April 13, 10:00, MJH-301
Title: Petri nets, Configuration Structures, and Process Graphs
In Nielsen, Plotkin & Winskel (1981) event structures were introduced
to give a representation of (unlabeled) safe Petri nets that abstracts
from the places in these nets, and to connect Petri nets with Scott
domains. In later work of Winskel, event structures were generalized
several times to capture more features of concurrency. In this talk I
propose `configuration structures' as a further generalization of event
structures, that is expressive enough to give a representation of
labeled Petri nets (that are not required to be safe) without losing
anything of their causal structure. History preserving process graphs
are introduced to play the role of domains in this general setting.
∂11-Apr-90 1747 ingrid@russell.Stanford.EDU CSLI Calendar, 12 April, vol. 5:23
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 17:47:01 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA04834; Wed, 11 Apr 90 16:03:18 PDT
Date: Wed, 11 Apr 90 16:03:18 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004112303.AA04834@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 12 April, vol. 5:23
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
12 April 1990 Stanford Vol. 5, No. 23
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 12 APRIL 1990
12:00 noon TINLunch
Cordura 100 A Representationalist Theory of Intention
Kurt Konolige and Martha E. Pollack
(konolige@ai.sri.com, pollack@ai.sri.com)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Computational Morphology
Speaker: Lauri Karttunen
(lauri@csli.stanford.edu)
Abstract in last week's Calendar
4:15 p.m. CSLI Colloquium
Cordura 100 Precompiled Syntactic Constraints for
Continuous Speech Recognition
Pierre Dupont
Philips Research Laboratory, Brussels
(dupont@prlb.philips.be)
Abstract in last week's Calendar
(Note change of location)
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 19 APRIL 1990
12:00 noon TINLunch
Cordura 100 Reading: Harmonic Grammar -- A Formal Multi-Level
Connectionist Theory of Linguistic Well-Formedness:
An Application
by Geraldine Legendre, Yoshiro Miyata, and
Paul Smolensky
Discussion led by Stanley Peters
(peters@csli.stanford.edu)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Developments in Phonological and
Morphological Theory
Speakers: Paul Kiparsky and Bill Poser
(kiparsky@csli.stanford.edu, poser@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Reading: Harmonic Grammar -- A Formal Multi-Level
Connectionist Theory of Linguistic Well-Formedness: An Application
by Geraldine Legendre, Yoshiro Miyata, and Paul Smolensky
Discussion led by Stanley Peters
This paper might have been called "Unaccusativity Meets
Connectionism." The authors observe that a semantic account of
unaccusativity in French, along the lines of Zaenen (1989), does not
cope adequately with the unaccusativity mismatches that plague a
syntactic account. Unaccusatives are a subclass of intransitive verbs
(e.g., the boldface [marked here with _ before and after the word]
ones in (1a) and (2a)) that occur in certain constructions where other
intransitive verbs (unergatives) cannot (cf. (1b) and (2b)).
(1) (a) La glace est facile a` faire _fondre_.
(b) *Les e'tudiants sont faciles a` faire _travailler_.
(2) (a) La neige _fondue_ a forme' de la boue.
(b) *Les e'tudiants _travaille's_ e'taient fatigue's.
Mismatches exist, as the intransitive verbs that can occur in (1a) are
not precisely the same as those that can occur in (2a). In fact, a
different set of verbs occurs in each of the ten diagnostic
environments for unaccusativity that exist in French.
The authors argue that a connectionist principle -- neural nets
maximize harmony (a global measure of activation levels and connection
strengths) -- yields an account of unaccusativity in French that is
empirically superior to any categorical semantic or syntactic account.
They studied 190 different combinations comprising an intransitive
verb and its argument noun phrase, testing each for unaccusative
behavior in four major diagnostic contexts. They trained a neural
network on raw acceptability judgments of the 760 resulting sentences;
it learned to use two semantic features of verbs and two semantic
features of their argument to assign graded acceptability judgments
with the correct polarity in 758 of the cases.
The authors contend that this local neural network can be seen as
approximating another network in which individual units have no
interpretation as linguistic entities (words, phrases, rules, or the
like) but instead "isoharmonically" distribute the computation of the
local network among themselves. Thus, they contend, the connectionist
framework is able both to fit the facts of human linguistic
performance and to explain how the familiar sort of categorical
linguistic description can approximate it.
____________
NEXT WEEK'S CSLI SEMINAR
Developments in Phonological and Morphological Theory
Paul Kiparsky and Bill Poser
_The Sound Pattern of English_, the work underlying virtually all
present-day work in phonology and morphology, provided an impoverished
phonological representation combined with a relatively unconstrained
theory of rules. Although work in computational phonology and
morphology has in general not advanced beyond this primitive stage,
there have been many developments in morphological and phonological
theory, such as:
- the lexical/postlexical division
- underspecification
- templatic morphology
- tighter constraints on rule form
- the discovery of the role of prosodic constituency
We will review some of the more important of these developments.
____________
SEMINAR ON THOUGHT AND LANGUAGE
Julius Moravcsik
(julius@csli.stanford.edu)
Wednesdays, 6:00-8:00 p.m.
Cordura 100
There has been a change of location for this seminar, which will now
be held in Cordura 100.
____________
SYMBOLIC SYSTEMS FORUM
The General Theory of Induction
Peter Cheeseman
Thursday, 12 April, 4:15 p.m.
Building 60, Room 61G
The basic theory of induction of models (theories) from data has
evolved over the last three centuries, and thanks to cheap available
computing, this theory now gives practical solutions to inductive
problems. Starting from very basic first principles, the Bayesian
calculus is shown to be the theory of belief under uncertainty. This
theory automatically provides the necessary trade-off between the fit
to the data and the complexity of the model.
Many philosophers in the past have recognized that this trade-off is
necessary (e.g., Ockham's Razor), but the Bayesian theory provides a
quantitative solution. This solution requires a prior probability
over possible models, and it is this requirement that causes many to
reject the Bayesian solution, because it appears to introduce a
subjective element into inductive inference.
This talk will show the necessity of prior knowledge, and show how
very weak prior knowledge can be translated into a bland
"uninformative" prior. In addition, the Bayesian approach will be
shown to give answers that do not depend on the language used to frame
the inductive problem. These philosophical points will be illustrated
by examples of Bayesian induction that far exceed human abilities.
Next talk, 19 April: Overview of Research at the Center for the Study
of Language and Information, Stanley Peters.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Has the Description Theory of Names Been Refuted?
Jerrold Katz
Graduate School and University Center
City University of New York
Friday, 13 April, 3:15 p.m.
Building 90, Room 92Q
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Variation in Negative Concord Systems
Bill Ladusaw
University of California, Santa Cruz
Friday, 13 April, 3:30 p.m.
Cordura 100
Negative concord is the multiple morphological marking of a single
clausal negation (as exemplified in the "nonstandard" English "I
didn't give nothing to nobody," synonymous with standard "I didn't
give anything to anyone"). The talk presents a semantic account of
negative concord and examines the syntactic variation among dialects
of negative concord in English and the Romance languages.
The gist of the semantic account is the treatment of concordant terms
as Heimian indefinites, which are necessarily bound in the scope of a
clause-level negation operator. The principal variation in negative
concord systems is described in terms of well-formedness conditions on
the incorporation of categorial chains projected between the
concordant terms and the clause domain over which the negation takes
scope. These well-formedness conditions state restrictions on the
identity and structural position of the topmost element in the
concordant chain.
Under this view, dialects with no negative concord are ones in which
every morphologically negative constituent must be the topmost element
in a chain. Among systems that allow negative concord, the principal
variation consists in whether the negation associated with the
inflected head of the clause must be topmost or not. This is what
distinguishes between the two principal concording dialects of
English. In one, where the inflection-associated negation must be
topmost, (i) and (ii) are not synonymous. In the other dialect, they
are.
(i) Nobody left.
(ii) Nobody didn't leave.
This contrast also divides the Romance languages, putting standard
Spanish and standard Italian in the former group, with Catalan and
some nonstandard dialects of Spanish in the latter group. (Given the
word-order properties of these languages, it is not possible to
clearly decide whether linear order or hierarchical structure is the
basis for the well-formedness condition, so information about negative
concord in non-SVO languages would be greatly appreciated.)
In concluding, I will explore the relationship between negative
concord and the licensing of the negative polarity determiner "any,"
presenting an argument that the two systems are closely related but
not subject to the same variation in well-formedness conditions. I
will also examine the subject-object asymmetry in long-distance
negative concord, which is claimed by Kayne (1984) to support the
Empty Category Principle as a well-formedness condition on logical
forms, and argue that the raising of the concordant term crucial to
this explanation makes incorrect semantic predictions.
____________
SYNTAX WORKSHOP
Presentative Structure in Chinese
Fu Tan
(tan@csli.stanford.edu)
Tuesday, 17 April, 7:30 p.m.
Cordura 100
In Chinese, certain verbs may have their logical subject alternate
between a preverbal and postverbal position. Most of these verbs also
have a locative argument. The locative argument has to be a PP, if
the logical subject is preverbal, but takes the form of a preverbal PP
or NP, if the logical subject is inverted. In the literature,
sentences whose logical subject is inverted are called presentative
sentences.
(a) Xuesheng zai tai-shang zuo zhe.
students PREP stage-top sit ASP
"The students are sitting on the stage."
(b) (zai) tai-shang zuo zhe xuesheng.
(PREP)stage-top sit ASP students
"On the stage are sitting students."
Li and Thompson (1975, 1978) consider both the preverbal and the
postverbal students invariably as the grammatical subject and take
their varied word order in sentences as evidence for the nonsubject
prominence of Chinese. Their argumentation is that a nonsubject
prominent language does not have any means to encode its subject as
subject-prominent languages do by word order, subject-verb agreement,
or case-marking, or redundantly by two or three of them at the same
time. The subject in Chinese, as they perceive it to be, is
inconsistently encoded, as far as the word order is concerned.
The subject/topic and subject/object verifying tests show that the
inverted LOC NP is the subject, not the topic, and the inverted
subject is the object, not the subject. Chinese is a SVO language in
which there is no such thing as a postverbal subject.
With subjects playing such a central role in syntax, as shown in the
grammatical processes and consistently encoded by word order, Chinese
is just as subject-prominent as, say, English. The only difference is
how languages display their subject-prominence: in English, a subject
not only responds to grammatical processes the same way a subject does
crosslinguistically, but also displays the prominence by case-marking
and agreement with the verb, whereas in Chinese, the subject displays
its prominence only by its stable preverbal position and its responses
to those processes.
The next workshop will be Tuesday, 1 May. Speakers will be Joan
Bresnan and Sam Mchombo.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Psychological Influences on Coronary Artery Disease
Steve Manuck
University of Pittsburgh
Wednesday, 18 April, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
NEW CSLI VISITOR
Yoshihiro Ueda
IAP Visiting Researcher
ATR Interpreting Telephony Research Laboratories, Japan
Dates of visit: 1 April-31 July 1990
Yoshihiro has been working on unification-based bidirectional grammar
generation for dialogue translation. While at CSLI, he would like to
incorporate the center's developing theories into his system of
generating sentences that appropriately reflect the speaker's
intentions. His research interests also include the proper syntactic
and semantic representation of sentences, the relationship between
surface illocutionary forces and deep illocutionary forces, and new
mechanisms of unification-based generation.
____________
∂11-Apr-90 2007 @Sunburn.Stanford.EDU:shoham@Hudson.Stanford.EDU Visiting professor
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Apr 90 20:07:48 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08779; Wed, 11 Apr 90 20:08:31 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA29021; Wed, 11 Apr 90 20:07:03 -0700
Date: Wed, 11 Apr 1990 20:07:02 PDT
From: Yoav Shoham <shoham@Hudson.Stanford.EDU>
To: ac@cs.Stanford.EDU
Subject: Visiting professor
Message-Id: <CMM.0.88.639889622.shoham@Hudson.Stanford.EDU>
In the last faculty lunch Nils mentioned that we intend to invite Hector
Levesque from Toronto to spend his sabatical here as a visiting professor.
Hector will be part time at the robotics lab and part time at CSLI. We also
intend to invite Tom Dean from Brown to spend his sabatical here. Neither
will require CSD resources. If we hear no objection, we will make the usual
default assumption.
Yoav
∂12-Apr-90 1051 chandler@Sunburn.Stanford.EDU NOTICE
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Apr 90 10:51:15 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19192; Thu, 12 Apr 90 10:51:24 -0700
Date: Thu, 12 Apr 1990 10:51:24 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: NOTICE
Message-Id: <CMM.0.88.639942684.chandler@Sunburn.Stanford.EDU>
In addition to posting this notice on the bulletin board, I thought it best
that you are made aware of it personally:
INFORMATIONAL MEETING
FOR THE ACADEMIC STAFF - RESEARCH
April 18, 1990
5:30 p.m.
Herrin Hall, Room 175
Professor Philip Hanawalt, Chairman of the Committee on the Professoriate,
and other Committee members, will be available in Herrin Hall, Room 175,
(Biological Sciences) at 5:30 on April 18th to discuss the recommendations of
the Committee as they would affect Research Associates and Senior Research
Associates,
This meeting is intended to provide information to the academic
staff-research on the Committee's recommendations in this area prior to the
presentation and discussion in the Faculty Senate on April 19th.
∂12-Apr-90 1217 LOGMTC-mailer MSRI Seminar Announcements, April 16-20
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 12 Apr 90 12:16:54 PDT
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA18020; Thu, 12 Apr 90 12:15:18 PDT
Received: by msri.org (4.0/SMI-4.0)
id AA01333; Thu, 12 Apr 90 12:12:26 PDT
Date: Thu, 12 Apr 90 12:12:26 PDT
From: david@msri.org (David Mostardi)
Message-Id: <9004121912.AA01333@msri.org>
To: weekly@msri.org
Subject: MSRI Seminar Announcements, April 16-20
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Seminar Announcements
for April 16 - 20, 1990
Monday, April 16
MSRI-EVANS MONDAY LECTURE 4:15 60 Evans Hall
A. Odlyzko "Polynomials with Restricted Coefficients: Results and Open Problems"
Tuesday, April 17
INFORMAL CORE MODEL SEMINAR 10:30 MSRI Seminar Room
P. D. Welch "Fine Structure" VI
SET THEORY 3:30 MSRI Lecture Hall
A.R.D. Mathias"A Final Look at Mac Lane Set Theory"
Wednesday, April 18
RECURSION THEORY 1:30 MSRI Lecture Hall
R. Soare "New Methods and Results on Automorphisms of Recursively Enumerable Sets"
Thursday, April 19
CROSS CULTURAL 11:00 MSRI Lecture Hall
A. Kechris "Descriptive Aspects of Borel Group Actions and Equivalence Relations" III
CENTER FOR PURE & APPLIED MATHEMATICS LUNCH TALK 12:10 (Bring your lunch)
S. Grotch " Greenhouse Warming-- 12:45 Faculty Club Conf. Rm.
The Recent Temperature Record and Computer Simulation"
INFORMAL CORE MODEL SEMINAR 2:30 MSRI Seminar Room
P. D. Welch "Fine Structure" VII
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
"To Be Announced"
Friday, April 20,
AREA III SEMINAR 11:00 MSRI Seminar Room
E. Packel "An Overview of Information Based Complexity"
∂12-Apr-90 1527 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU commencement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Apr 90 15:27:10 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26650; Thu, 12 Apr 90 15:27:07 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA08391; Thu, 12 Apr 90 15:26:43 PDT
Date: Thu, 12 Apr 90 15:26:43 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004122226.AA08391@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: commencement
We have all just received announcements and
invitations for Stanford's commencement exercises
on June 17. I hope you all feel as I do that ceremonies
like commencement are extremely important in the
life of the university. In particular, I hope especially that
all of us who have students with whom we have been associated
and who are getting degrees this year will be attending commencement to
give them and their relatives and friends our congratulations and
best wishes.
-Nils
∂12-Apr-90 1559 helen@russell.Stanford.EDU majors event
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Apr 90 15:59:46 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA12673; Thu, 12 Apr 90 16:02:03 PDT
Date: Thu 12 Apr 90 16:02:01-PDT
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: majors event
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <639964921.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
TO: SSP FACULTY
As you've probably heard from your "home" departments, Majors Event takes place
in the Quad this coming Wednesday, April 18. SSP will have a table their too.
We invite you to spend a half hour at SSP's table any time during the
period 10am--2pm.
I believe students take as a sign of faculty involvement in the program, their
presence or abscence at events such as these (whether or not this is so), so
if this fits in at all with your schedule, we'd like you to join us.
If there's a specific half-hour slot that suits you, let me know and I'll
create a timetable and keep you posted on open vs. filled slots. I wont be
able to be there at all from 10-12:30, so let me know if you can take the
slots during that period.
Thanks,
Helen
-------
∂13-Apr-90 0913 chandler@Sunburn.Stanford.EDU Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 09:13:46 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07195; Fri, 13 Apr 90 09:13:31 -0700
Date: Fri, 13 Apr 1990 9:13:30 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com,
stefik@cs.Stanford.EDU
Subject: Faculty Lunch
Message-Id: <CMM.0.88.640023210.chandler@Sunburn.Stanford.EDU>
Just a reminder.....next Tuesday's faculty lunch "features" Ivan Sag who will
talk to us about Natural Language Research at Stanford. See you 4/17 at
12:15 in Margaret Jacks room 220.
∂13-Apr-90 1515 @Sunburn.Stanford.EDU:tah@linz.Stanford.EDU Forsythe Award
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 15:15:32 PDT
Received: from linz.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22734; Fri, 13 Apr 90 15:13:51 -0700
Received: by linz.stanford.edu (5.59/25-eef) id AA19938; Fri, 13 Apr 90 15:11:18 PDT
Message-Id: <9004132211.AA19938@linz.stanford.edu>
To: students@cs.Stanford.EDU, faculty@cs.Stanford.EDU, csd@cs.Stanford.EDU
Subject: Forsythe Award
Reply-To: tah@cs.Stanford.EDU
Date: 13 Apr 90 15:11:14 PDT (Fri)
From: Tom Henzinger <tah@linz.Stanford.EDU>
Nominations are invited, especially from students, for the
Sixteenth George E. Forsythe Award. This award is given
annually by the Computer Science Department, following the
recommendations of a committee composed of the past winners
that are still at Stanford.
The Forsythe Award recognizes outstanding student contributions
to the teaching of Computer Science at Stanford. The award
criteria guidelines require that a recipient exhibit continued
involvement as well as excellent achievement in the field of
teaching. Recent winners of the Forsythe Award have been
Oren Patashnik, Simran Singh, Devika Subramanian, Steve Fisher,
Mike Cleron, and Tom Henzinger.
Please mail your Forsythe Award nominations to tah@cs. Include
with your nomination an explanation of how your nominee fulfills
the requirements. The deadline for nominations is June 1.
Thank you,
The Forsythe Award Committee
∂13-Apr-90 1703 turner@sierra.Stanford.EDU INFORMATIONAL MEETING
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 17:03:06 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Fri, 13 Apr 90 16:58:59 PDT
Date: Fri, 13 Apr 90 16:58:59 PDT
From: turner@sierra.Stanford.EDU (Sherry A. Turner)
To: EE-FACULTY@sierra.Stanford.EDU
Cc: EE-ADMINLIST@sierra.Stanford.EDU
Subject: INFORMATIONAL MEETING
Message-Id: <CMM.0.88.640051138.turner@>
INFORMATIONAL MEETING
FOR THE ACADEMIC STAFF - TEACHING
APRIL 17, 1990
5:30 P.M.
HERRIN HALL, ROOM 175
Professor Philip Hanawalt, Chairman of the Committee on the Professoriate,
and other Committee members, will be available in Herrin Hall, Room 175,
(Biological Sciences) at 5:30 on April 17th to discuss the recommendations
of the Committee as they would affect Lecturers and Senior Lecturers.
This meeting is intended to provide information to the academic staff
teaching on the Committee's recommendations in this area prior to the
presentation and discussion in the Faculty Senate on April 19th.
∂13-Apr-90 2000 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SWAT'90
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 19:59:53 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA26579; Fri, 13 Apr 90 19:58:37 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27366; Fri, 13 Apr 90 19:58:05 -0700
Message-Id: <9004140258.AA27366@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7026; Fri, 13 Apr 90 21:53:46 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6944; Fri, 13 Apr 90 21:53:44 CDT
Date: Fri, 13 Apr 90 01:55:35 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
bengt@eik.II.UIB.no
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: bengt%eik.II.UIB.no@VM1.NoDak.EDU
Subject: SWAT'90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
SWAT 90 CLARIFICATION OF DATES: 11 - 14 JULY 1990
The second Scandinavian Workshop on Algorithm Theory (SWAT 90) will be
held from 11 through 14 July 1990, at the Hotel Norge in Bergen, Norway.
Some recent correspondence about SWAT had a misprint of "June" for "July";
as printed in the call for papers, 11-14 July are the correct dates!
The final program and local information will be mailed in late April.
Please contact Bengt Aspvall (bengt@eik.ii.uib.no, +47 5 544156) or
John Gilbert (gilbert.pa@xerox.com, +1 415 4944487) for more information.
∂13-Apr-90 2000 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU TCS Olympiad
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 19:59:51 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA26584; Fri, 13 Apr 90 19:58:47 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27391; Fri, 13 Apr 90 19:58:36 -0700
Message-Id: <9004140258.AA27391@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7640; Fri, 13 Apr 90 21:54:13 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7451; Fri, 13 Apr 90 21:54:10 CDT
Date: Fri, 13 Apr 90 01:57:53 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Rajamani Sundar <sundar@CSD4.CS.NYU.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Rajamani Sundar <sundar%CSD4.CS.NYU.EDU@VM1.NoDak.EDU>
Subject: TCS Olympiad
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Prof. Pandurangan from India wishes to post the following message on the net.
Please direct your responses to him (address below).
.............................................................................
Dear friends and colleagues:
I propose to organise a Theoretical Computer Science Olympiad (TCS Olympiad)
around November 1990. The topics covered are
Graph Theory, Combinatorics, Mathematical Logic, Automata, Languages and
computation theory, Design and analysis of algorithms, formal development
of programs and correctness proofs (Dijkstra-Gries-Feijen Type problems).
Standard topics covered in an undergraduate curriculum
are sufficient to begin with. One can contemplate Olympiads at different
levels if there is sufficient response at various levels.
Comments, suggestions and volunteers are most welcome.
We have informally tried out some models which has given us some insight
and it turns out to be positive and encouraging. My strong feeling is that
in TCS we now have enough mathematically mature and well-defined
topics with many medium-sized and clever problems created and
solved in the recent past. Such a competition would bring the
hidden potentials in the young TCS community to limelight.
Also I wish to organise the same with participation from all over
the world with the exam conducted in a distributed manner!!!
The support from EACTCS, ACM, etc. will be sought after finalising
the details of the project.
My Address for hard mail:
DR.C.PANDU RANGAN, DEPT OF COMPUTER SCIENCE AND ENGINEERING,
INDIAN INSTITUTE OF TECHNOLOGY, MADRAS- 600 036, INDIA.
e-mail:: shakti!shiva!rangan@uunet.uu.net
TELEX: 41-21062 IITM IN
I prefer hard mail as for as possible. If I receive a good responce
I shall periodically post on theory net the summary.
∂13-Apr-90 2112 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU 1990 ACM SPAA Program and Registration
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 21:12:23 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28113; Fri, 13 Apr 90 21:12:46 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28848; Fri, 13 Apr 90 21:09:12 -0700
Message-Id: <9004140409.AA28848@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5234; Fri, 13 Apr 90 22:31:51 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5031; Fri, 13 Apr 90 22:31:44 CDT
Date: Fri, 13 Apr 90 02:37:50 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Tom Leighton <ftl@theory.lcs.mit.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Tom Leighton <ftl%theory.lcs.mit.edu@VM1.NoDak.EDU>
Subject: 1990 ACM SPAA Program and Registration
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
------------------------------------------------------------------------------
S P A A '9 0 P R O G R A M
------------------------------------------------------------------------------
2nd Annual ACM Symposium on Parallel Algorithms and Architectures
In combination with the Aegean Workshop on Computing
July 2-6, 1990
Island of Crete, Greece
Sponsored by
ACM SIGACT
ACM SIGARCH
In-Cooperation with
IEEE, EATCS, and CTI
------------------------------------------------------------------------------
SPAA '90 Registration Form
Category
1. ACM, IEEE, or EATCS member $195 $245
2. Author or Program Committee Member $195 $245
3. Non Members $245 $295
4. Full-time Student $ 60 $ 90
REGISTRATION FEE INCLUDES: Monday Reception, Tuesday Business
Meeting, Wednesday Daytrip-Excursion, Thursday Banquet, coffee
breaks, and a copy of the proceedings. Note: the hotel registration
includes breakfast and one of lunch or dinner each day.
STUDENT REGISTRATION FEE INCLUDES: all of the above except the
daytrip and the banquet.
Number________of additional banquet tickets at $35 each.
Number________of additional daytrip tickets at $40 each.
Name____________________________________________
Affiliation_____________________________________
Address_________________________________________
________________________________________________
Phone___________________________________________
E-mail__________________________________________
Dietary Restrictions:
Kosher________ Vegetarian________
Please fill out the above registration form and mail (airmail) with
check to:
Ms. Rozina Efstathiadou
Administrative Manager
SPAA / AWOC '90 Local Arrangements Committee
The Computer Technology Institute (CTI)
P.O. Box 1122, 26110 Patras, Greece
FAX #: (3061) 222086
Telephone: (3061) 225073 / 273496
Telex: 312515 CTI Greece
------------------------------------------------------------------------------
SPAA '90 Hotel reservation Information
Capsis Beach Hotel
Aghia Pelagia, Heraklion, Crete
CONFERENCE LOCATION: SPAA / AWOC '90 will held on Crete, the largest
Greek island. The conference will be held at the CAPSIS Beach Hotel,
which is located on a peninsula 25 km from Heraklion airport, in one
of the most picturesque regions of the island, at Aghia Pelaghia
village. The hotel address is given (under general information) only
for those needing special arrangements or as a contact point to family
and friends. Please make all your arragements via MANOS travel using
the form provided and writing down in detail any special tours, longer
stay, etc, you may wish.
CAPSIS BEACH Hotel is located on a majestic peninsula, about 40 km
west of Heraklion, Crete. (Note: Heraklion is also spelled Iraklion).
It is on the north side of the island, along the new road to
Rethymnon. The local arragements committee has booked rooms at the
Capsis Beach Hotel at special rates trough travel agency Manos Travel
System S.A. Capsis is a luxury-class hotel, surrounded by sandy
beaches, crystal clear blue water, with 1150 beds arranged in a huge
complex of bungalows, main buildings, gardens, tennis courts, pools,
restaurants, etc.
ALL HOTEL REQUESTS ARE ON A FIRST COME FIRST SERVE BASIS AND MUST
NOT BE RECEIVED LATER THAN MAY 15. After this date, due to the high
tourist season, applications will be processed but not guaranteed.
Please indicate on the hotel registration form your preference for a
room and bear in mind that children cost extra since meals are
included. Also, regulations exist as to how many persons can be in
one room. The hotel rates are on a half-board basis and include
taxes. Telephone calls, telex etc. are extra and should be checked a
head of time to avoid misunderstandings.
Given the fact that daily breakfast and lunch or dinner come with the
hotel and the very special price arranged by the committee. We
strongly urge the participants to stay at the hotel rather than look
for accommodations elsewhere. We will not be responsible for arranging
hotel meals for non-hotel participants or for transportation to other
hotels. To guarantee your reservation, a non-refundable Deposit of
$100 per room must be sent by May 15. The quoted room rates apply for
the period July 1-July 11. Reservations received after the contracted
block of rooms is full are subject to space and rate availability.
Please make all checks payable to SPAA'90 Manos Travel System S.A.
send mail it to the address below no later than Maay 15.
Manos Travel System S.A. (SPAA '90)
39 Panepistimiou Street
Athens 10564 - Greece
Tel (301) 3250711, Tlx 215145 (Greece)
Fax: (301) 3229908
------------------------------------------------------------------------------
SPAA '90 HOTEL RESERVATION FORM
July 2-6, 1990
Prices Per Person (Half boaard, 5 nights): (Note: all payments must
correspond to the prices listed in US dollars for consistency: the
current exchange rate is about 165 Greek dracmas/one US dollar):
Triple: $215 (about 35,475 drachmas)
Double: $260 (about 42,900 drachmas)
Sigle: $326 (about 53,790 drachmas)
Children ages 0-6 can stay with their parents for free. Add $30
for each child aged 6-12.
To guarantee your reseervation, a nonrefundable deposit of $100 per
room is the minimum requirement. The check can be a US check, money
order or Eurochec (maximum 25,000 drachmas). Payment must correspond
to value in US dollars.
Name: ____________________________________________________________
Institution: _____________________________________________________
Mailing Address: _________________________________________________
Country: _________________________________________________________
Daytime phone: _________________ Evening phone: _________________
Fax: #__________________________
E-Mail: __________________________ TLX: __________________________
Arrival Date: ______________ Arrival (flight) Time: ____________
Departure Date: ___________ Departure (flight) Time: ___________
Accompanying Persons (list name and, if child, indicate age):
1. __________________________ 2. __________________________
3. __________________________ 4. __________________________
Number of Rooms Requested:
Single __________ Double ________ Number of Nights _____________
Sharing With: ___________________________________________________
Total Cost ____________________ Sum enclosed in $US ______________
(NOTE: For any special request, please attach letter with details.)
Please mail by May 15 with check payable to:
MANOS Travel System S.A. (SPAA '90)
39 Panepistimiou Street
Athens 10564 - Greece
Tel (301)3250711, TLX 215145 (Greece)
Fax: (301) 3229908
------------------------------------------------------------------------------
P R O G R A M
------------------------------------------------------------------------------
TUESDAY, JULY 3, 1990
SESSION 1
8:45 Average Case Analysis of Greedy Routing Algorithms on Arrays
F. T. Leighton, MIT
9:10 Message Passing Algorithms for a SIMD Torus with Coteries
M. Herbordt and C. Weems, University of Massachusetts;
D. Shue, Hughes Research Labs
9:35 The Chaos Router: A Practical Application of Randomization in
Network Routing
S. Konstantinidou and L. Snyder, University of Washington
10:00 BREAK
10:20 Tight Bounds for Oblivious Routing in the Hypercube
C. Kaklamanis, Harvard University;
D. Krizanc, University of Rochester;
A. Tsantilas, Harvard University
10:45 Running Algorithms Efficiently on Faulty Hypercubes
J. Bruck, R. Cypher, and D. Soroker,
IBM Almaden Research Center
11:10 Efficient Communication on Hypercubes
D. Greenberg and S. Bhatt, Yale University
11:35 Fast Algorithms for Bit-Serial Routing on a Hypercube
B. Aiello, Bell Communications Research;
T. Leighton and B. Maggs, MIT;
M. Newman, Temple Barker and Sloane
12:00 LUNCH
SESSION 2
2:00 Low Overhead Parallel Schedules for Task Graphs
R. Anderson, P. Beame, and W. Ruzzo, University of Washington
2:25 Asynchronous Shared Memory Parallel Computation
N. Nishimura, University of Toronto
2:50 The Expected Advantage of Asynchrony
R. Cole and O. Zajicek, New York University
3:15 Parallel Algorithms for Generating Random Permutations on a
Shared Memory Machine
R. Anderson, University of Washington
3:40 BREAK
4:00 Processor Networks and Alternating Machines
J. Buss, University of Waterloo
4:25 Lower Bounds for Parallel Computation on Linked Structures
F. Fich, University of Toronto;
V. Ramachandran, University of Texas at Austin
4:50 Every Robust CRCW PRAM Can Efficiently Simulate a PRIORITY PRAM
T. Hagerup, Universitat des Saarlandes;
T. Radzik, Stanford University
5:15 Exact Time Bounds for Computing Boolean Functions on PRAMs
Without Simultaneous Writes
M. Dietzfelbinger, Universitat-GH;
M. Kutylowski, University of Wroclaw;
R. Reischuk, Technische Hochschule Darmstadt
THURSDAY, JULY 5, 1990
SESSION 3
8:45 Resource Tradeoffs in Fast Long Integer Multiplication
M. Shand, DEC Paris Research Lab.;
P. Bertin, I.N.R.I.A., Rocquencourt;
J. Vuillemin, DEC Paris Research Lab.
9:10 Optimal-Time Multipliers and C-testability
B. Becker, Johann Wolfgang Goethe-Universitat; J. Hartmann,
Universitat des Saarlandes
9;35 Cache Coherence for Large Scale Shared Memory Multiprocessors
M. Thapar; B. Delagi, Stanford University
and Digital Equipment Corp.
10:00 BREAK
10:20 FLIP-FLOP: A Stack-Oriented Multiprocessor System
P. Grabienski, University of Dortmund
10:45 Analysis of Multithreaded Architectures for Parallel Computing
R. Saavedra-Barrera, University of California at Berkeley
and Universidad Autonoma Metropolitana, Mexico City;
D. Culler and T. von Eicken, Universidad Autonoma
Metropolitana, Mexico City
11:10 Architectural Support for the Efficient Data-Driven
Evaluation Scheme
H. Vin and F. Berman, University of California at San Diego
11:35 Utilizing Virtual Shared Memory in a Topology Independent,
Multicomputer Environment
C. Maples, Sandia National Labs
12:00 LUNCH
SESSION 4
2:00 High-Probability Parallel Transitive Closure Algorithms
J. Ullman, Stanford University; M. Yannakakis, AT&T Bell Labs
2:25 A Parallel Planar Graph Isomorphism Algorithm
H. Gazit and J. Reif, Duke University
2:50 A New Preconditioner for the Parallel Solution of Positive
Definite Toeplitz Systems
D. Bini, Universita di Pisa; B. Benedetto, Universita di Genova
3:15 Disjoint Paths Through a 3-Dimensional Grid
M. Brady, Lockheed R\&D Div.; D. J. Brown and P. McGuinness,
University of Illinois at Urbana
3:40 BREAK
4:00 Parallel Construction of Near Optimal Binary Trees
D. G. Kirkpatrick and T. Przytyacka,
University of British Columbia
4:25 Parallel Least-Squares Solution of General and Toeplitz-like
Linear Systems
V. Pan, CUNY
4:50 On the Euclidean Scheme for Polynomials Having Interlaced Real
Zeros
D. Bini, Universita di Pisa; L. Gemignani, Ministero del Lavoro
5:15 Parallel Searching in Generalized Monge Arrays with Applications
A. Aggarwal, IBM T.J. Watson Research Center;
D. Kravets and J. Park, MIT; S. Sen, Duke University
FRIDAY, JULY 6, 1990
SESSION 5
8:45 Parallel Rectilinear Shortest Paths with Rectangular Obstacles
M. Atallah and D. Chen, Purdue University
9:10 Generalized Sweep Methods for Parallel Computational Geometry
M. Goodrich, M. Ghouse, and J. Bright, Johns Hopkins University
9:35 Efficient Parallel Computation of Arrangements of Hyperplanes
in d Dimensions
T. Hagerup, Universitat des Saarlandes;
H. Jung, Humboldt-Universitat, Berlin;
E. Welzl, Freie Universitat, Berlin
10:00 BREAK
10;20 Parallel Algorithms for Arrangements
R. Anderson, P. Beame, and E. Brisson, University of Washington
10:45 Optimal Cooperative Search in Fractional Cascaded Data Structures
R. Tamassia and J. S. Vitter, Brown University
11:10 P-Complete Geometric Problems
M. Atallah, Purdue University;
P. Callahan and M. Goodrich, Johns Hopkins University
11:35 Random Sampling Techniques for Binary Search on Fixed
Connection Networks with Applications to Geometric Algorithms
J. Reif and S. Sen, Duke University
SESSION 6
2:00 Wait-Free Data Structures in the Asynchronous PRAM Model
J. Aspnes, Carnegie-Mellon University;
M. Herlihy, Digital Equipment Corp.
2:25 A Foundation for Sequentializing Parallel Code
B. Simons, D. Alpern, and J. Ferrante, IBM Almaden Research Center
2:50 Preconditioning Index Set Transformations for Time-Optimal
Affine Scheduling
B. Lisper, Royal Institute of Technology, Stockholm
3:15 Study of Parallelism in Regular Iterative Algorithms
V. P. Roychowdhury and T. Kailath, Stanford University
3:40 BREAK
4:00 Fast Fault-Tolerant Parallel Communication and On-Line
Maintenance Using Information Dispersal
Y.-D. Lyuu, Harvard University
4:25 On the Computational Equivalence of Hypercube-Derived Networks
E. Schwabe, MIT
4:50 A Unified Approach to Off-Line Permutation Routing on Parallel
Networks
F. Annexstein and M. Baumslag, University of Massachusetts
5:15 Space-Efficient Representations of Shared Data for Parallel
Computers
K. Herley, Cornell University
------------------------------------------------------------------------------
GENERAL INFORMATION
Host Country: Greece is the land of myth and legend, and the
cradle of western civilization. It occupies the southern part of the
Balkan Peninsula. Due to its configuration, Greece is linked to other
European countries and the rest of the world by a dense network of
air-sea-rail and motor routes. Its population size is approximately
10 million and its total area 51,182 sq. miles. The unique
combination of temperate climate year round, the reputed cultural
interest and the existing ecological treasures, make Greece an ideal
conference destination. In addition, the charm and fascination held
by its jewels, and Aegean and Ionlian Islands, can give the visitor
memorable experiences.
Information about Crete: Crete is a great island, not only in
size, but in its historical importance, its cultural wealth and its
diverse natural beauty. For some, Crete is the home of the Minoants,
and archaeological treasure chest. Fro others, Crete is an island of
sunshine, of remote beaches (north and southwest), of cosmopolitan
excitement (St. Nicholas beach on the east), home of the Samaria Gorge
(largest in Europe) and the Lasithi plateau which lovers ascend in
November to collect oranges and watch thousands of windmills turn
time... It is also the birthplace of Zeus and the homeland of
Zorba-like men who like ouze for breakfast.
Climate and Clothing: The climate is generally hot and dry
during May-September and light wardrobe would do. Bring a sweater for
cool evenings. If you plan to visit the mountains, be prepared for
cool weather. Greeks ar informal dressers and, at the beaches, almost
anything or nothing goes. However, like most Europeans, Greeks expect
respect for their churches, national monuments and for social-hour
events. They do not like to see people wear beachwear in towns or
stores or at sit-down restaurants away from the beach. Villages and
people are traditional and conservative. Whatever you do not bring,
you can buy there.
Hotel Address in Crete:
Capsis Beach Hotel, P.O. Box 72, Heraklion, Crete, Greece
Tel (3081) 233395-7, 811212, 811234
TLX: 262204 Fax: (3081) 811076
Main Offices in Athens:
6, Pasteur Street, 115 21 Athens, Greece
Tel (301) 6421024-7, (301) 6449320
Fazz: (301) 644-4830 TLX: 219022 CH GR
Hotel Facilities: The hotel has a large open air sea water Olympic
size swimming pool, a pool for diving, a children's pool and an indoor
pool. It offers spacious lounges, sun terraces, TV room, extensive
gardens, playground, sauna, hairdressing salon, card playing room,
game room, four restaurants, two snack bars, coffee shop and cocktail
bar. Located on two private sandy beaches, the hotel offers a variety
of sea sports (extra cost) such as water skiing, canoes, wind
surfing, sailing, and others. In addition, there are four tennis
courts, minigolf, volleyball, parachuting, bicycles and mopeds, table
tennis, and night club or discotheque entertainment.
Registration: A registration desk will be set up at the hotel
between 6:30 pm and 9:00 pm on Monday evening, July 2. The
registration desk will also be open Tuesday and Thursday mornings for
late-comers.
Transportation: Attendees should fly to Heraklion Airport on
Crete. Heraklion airport is serviced by several Airlines form major
European cities, and is conveniently reached via Athens. There will
be a welcoming committee at Heraklion airport on Monday, July 2, to
help arrange transportation to the hotel. Otherwise, the hotel is
most conveniently reached by taxi. The taxi should cost about
1,500-3,000 drachmas (about $10-12). The Capsis hotel is located in
Aghia Pelaghia, which is 25 km west of the airport and about 40 km
west of the main city, Heraklion. there are airport buses (Olympic
Airways Buses) from the airport to Heraklion which run every 50
minutes from the airport to the city's air terminal called Platia
Eleftherias (Square of Freedom). From the main city of Heraklion to
Aghia Pelaghia (Capsis Hotel), there are public buses form Central
Heraklion Station (near the port which takes about 45 minutes and run
daily at 09:00, 09:45, 14:30 and 17:00 (cost about $2). An
alternative airport is Rethymnon Airport which is located about 2
hours west of the hotel (by car). There is also a ferry from the port
of Piraeus (in Athens)to Heraklion that takes about 12 hours.
Student Support: Some travel money may be available for students
wishing to attend SPAA'90. Priority will be given to speakers and
authors with insufficient funds. If interested, please contact Alok
Aggarwal at the IBM Watson Research Center, PO Box 218, Yorktown
Heights, NY 10598.
SOCIAL EVENTS
Besides the many ongoing and nightly social events arranged by the
hotel, the SPAA/AWOC'90 local arrangements committee has planned a
memorable program which is a mixture of history, culture and plain
fun.
Monday Reception: There will be a welcoming wine reception for
incoming participants (about 7-10pm) on Monday evening at the Capsis
Beach Hotel.
Tuesday Business Meeting: There will be a business meeting at 6:00 pm
Tuesday afternoon. All registrants are encouraged to attend.
Wednesday ALL DAY Excursion: According to AWOC's tradition, one day
of the conference is reserved free of talk for the participants to
``bond'' and to have a chance to talk with each other while they are
getting to know the surroundings. For Wednesday, July 4, we are
planning a full day of guided archaeological tours to the oldest
(4,000-1,500 BC) and most sophisticated settlements in Europe. We
will visit the unique museum of Heraklion, and a few of the many
ancient city-state palaces of Crete: Knossos (the famous Minotaur
story took place here), Faesios, Gortyna, Aghia Triada (some are still
being excavated). For lunch and swimming, we will go to the beautiful
sandy beach of Matala (southern side of the island, facing Africa)
where the first nudist hippies appeared back in the early 60's and dug
into the surrounding limestone hills ``houses'' to settle in (the
local arrangements committee does not recommend this).
Thursday Banquet Barbecue: We will have a barbecue Thursday evening at
the hotel's tavern by the beach. There will be Greek cuisine, music,
dancing and Greek-style fun (``wear a Toga'' is the theme this year).
------------------------------------------------------------------------------
Further Information (tips, hints, recommendations):
We will arrange for a welcome committee to be at the airport during
Monday, when most hotel guests arrive.
For those with accompanying persons or who wish to explore the
island on their own later, we strongly recommend renting a car (jeep)
(Hertz or AVIS offer good service but all care rates are controlled in
Greece). It will be worth the cost in the long run. Scooters are
cheap and in abundance and we recommend them only for the brave or
experienced European travelers.
Taxis are generally cheap by American or North European standards.
We recommend you ask the price before you board the taxis, if you are
worried.
A tip is included in the prices but a good tip will get you a long
way anywhere and it is given in Greece to round off a figure.
Bring beach essentials (suntan lotion, a good sun hat), comfortable
shoes or sandals, a map or book on Crete/Greece, a fun-evening outfit
for the banquet, and a jacket/sweater for cool nights. For those who
are interested, the clientele of the hotel is rather high and will be
well-dressed.
For your departure transfer arrangements, please contact the
conference registration desk at least two days prior to departure.
Contact Persons:
For specific information regarding accommodations, registration, and
fees, contact the local arrangements manager Ms. Rozina Eftstathiadou
via FAX: (3061) 222-086 or call between 9-2:30 Greek time at (3061)
225073 or (3061) 273496.
For futher general information, you can contact:
Fillia Makedon, computer Science Program
The University of Texas at Dallas
Richardson, Texas 75083
Tel: (214) 690-2182
email: makedon@utdallas.edu
Fax: (214) 690-2349
Paul Spirakis, CTI
The University of Patras
P.O. Box 1122
26110 Patras, Greece
Tel. (3061) 993174 or (3061) 225073
Fax: (3061) 222086
We look forward to hosting you in Greece, and we wish you a
nice trip and a wonderful. Stay.
Conference Chair:
Tom Leighton
Local Arrangements Chairs:
Fillia Makedon / Paul Spirakis
Treasurer:
Alok Aggarwal
Program Committee Chair:
Franco Preparata
Program Committee:
Gianfranco Bilardi Franco Preparata
Dennis Gannon Arnie Rosenberg
Richard Karp Jorge Sanz
Tom Knight H. J. Siegel
Fabrizio Luccio Mare Snir
Kurt Mehlhorn Paul Spirakis
∂13-Apr-90 2158 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Dimacs Workshop on Practical Issues in Geometry
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Apr 90 21:58:00 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA29305; Fri, 13 Apr 90 21:58:25 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28945; Fri, 13 Apr 90 21:55:20 -0700
Message-Id: <9004140455.AA28945@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6624; Fri, 13 Apr 90 22:34:01 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6080; Fri, 13 Apr 90 22:33:47 CDT
Date: Fri, 13 Apr 90 02:38:42 CDT
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Bernard Chazelle <chazelle@Princeton.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Bernard Chazelle <chazelle%Princeton.EDU@VM1.NoDak.EDU>
Subject: Dimacs Workshop on Practical Issues in Geometry
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Dimacs Workshop on Practical Issues in Geometry
Department of Computer Science
Computer Science Building
Olden Street
Princeton University
April 16--20
Program
Monday, April 16
10:29--10:30 Welcoming Words
10:30--11:00 Efficient Delaunay Triangulation Using Rational Arithmetic
Michael Karasick
11:15--12:00 Epsilon Geometry: Building Robust Algorithms from
Imprecise Computations
David Salesin
2:15--3:15 Degeneracy Control in Geometric Programs: A Progress
Report
Herbert Edelsbrunner, Ernst Muecke and Harald Rosenberger
3:30--4:00 Coping with Exact Computations
Chee Yap
Tuesday, April 17
10:15--10:45 Low Level Techniques for Robust Geometry
Victor J. Milenkovic
11:00--11:30 Stable algorithms for some 2d geometric problems
Steve Fortune
11:45--12:15 Techniques for Visualizing 3-Dimensional Manifolds
Michael Laszlo
2:30--3:15 Pythagorean Hodographs
Rida Farouki
3:30--4:00 An Overview of Hierarchical Spatial Data Structures
Hanan Samet
Wednesday, April 18
10:15--10:45 Square-Root Parametrization of Genus Two Curves
Ram Abhyankar
11:00--11:30 Robust Geometric Computations
Deborah Silver
11:45--12:15 Geometric Modeling with Algebraic Surfaces:
GANITH & SHILP Toolkits
Chanderjit Bajaj
2:30-- Talks to be announced
6:30--9:00 Buffet Dinner
Thursday, April 19
10:30--11:00 The Contour Problem for Restricted-Orientation Polygons
Diane L. Souvaine
11:15--11:45 Computing the Minimum Hausdorff Distance for Point
Sets Under Translation
Klara Kedem
2:30--3:15 Towards Interactive Lighting Simulation
Claude Puech
3:30--4:00 On Computing the Intersection of B-spline Surfaces
Balas K. Natarajan
Friday, April 20
10:15--10:45 Computational Geometry Issues in Cartography
W.R. Franklin
11:00--11:30 The Distance Representation of Surfaces
John K. Johnstone
For more information, please contact Bernard Chazelle at
chazelle@princeton.edu or 609-258-5380
∂14-Apr-90 0953 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU 1990/91 Comp Exam
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Apr 90 09:53:48 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01660; Sat, 14 Apr 90 09:54:24 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA09405; Sat, 14 Apr 90 09:53:54 PDT
Date: Sat, 14 Apr 90 09:53:54 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004141653.AA09405@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Cc: bureaucrat@cs.stanford.edu
Subject: 1990/91 Comp Exam
The PhD students were asked, at our last faculty meeting,
to advise us about when they would like to see the (single)
1990/91 PhD Comprehensive exam given. They have responded
that they would like to see it given early in Autumn Quarter.
If we are to accommodate their preference, we should appoint
a "comprehensive exam czar" soon because the exam will need
to be composed, tested, etc. during late summer. The purpose
of this note is to seek a volunteer czar. Last year, Zohar
Manna was the chief comp organizer. Here is an opportunity
for someone to fulfill his/her departmental citizenship
duties in a way that gets them finished early in the year.
Volunteers?
-Nils
∂14-Apr-90 1003 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Congressional Budget and grant money
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Apr 90 10:03:27 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA27921; Sat, 14 Apr 90 10:03:53 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01683; Sat, 14 Apr 90 09:59:18 -0700
Message-Id: <9004141659.AA01683@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4233; Sat, 14 Apr 90 11:53:47 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3681; Sat, 14 Apr 90 11:53:44 CDT
Date: Sat, 14 Apr 90 03:14:04 CDT
Reply-To: Barbara Simons <SIMONS%ALMVMD.BITNET@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Barbara Simons <SIMONS%ALMVMD.BITNET@VM1.NoDak.EDU>
Subject: Congressional Budget and grant money
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Are you having sleepless nights worrying about your grant proposal?
Are your students working as short-order cooks to earn money to pay
for computer time?
Is your university threatening to cut off your telephone because
you didn't bring in enough grant money?
Then, now is your chance to get involved!
The following message is copied from Whatsnew, a weekly electronic
newletter published by the American Physical Society.
Barbara
1. CONGRESS IS REQUIRED TO HAVE A BUDGET RESOLUTION BY 15 APRIL--
but it's not even close as they leave today for Easter vacation. A
budget resolution provides the blueprint that both houses must
follow in spending bills. It is broken down by budget function
with NSF, NASA and DOE's General Science Program lumped together in
Function 250. It is within the finite 250 allocation that the NSF,
the SSC and space station Freedom go head-to-head. So much for the
myth that the funding of one does not affect the other. At this
point, however, it is in everyone's interest that the 250
allocation be set as high as possible. Persons concerned about
funding for science should contact their elected representatives.
Robert L. Park (202) 232-0189 The American Physical Society.
∂14-Apr-90 1357 LOGMTC-mailer [pratt@cs.Stanford.EDU : Talk by Rob van Glabbeek ]
Received: from Hudson.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Apr 90 13:57:24 PDT
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA13137; Sat, 14 Apr 90 13:56:44 -0700
Date: Sat, 14 Apr 1990 13:56:43 PDT
From: Yoav Shoham <shoham@Hudson.Stanford.EDU>
To: logmtc@sail.Stanford.EDU
Subject: [pratt@cs.Stanford.EDU : Talk by Rob van Glabbeek ]
Message-Id: <CMM.0.88.640126603.shoham@Hudson.Stanford.EDU>
Return-Path: <@Sunburn.Stanford.EDU:LOGMTC-mailer@SAIL.Stanford.EDU>
Received: from Sunburn.Stanford.EDU by Hudson.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07745; Fri, 6 Apr 90 18:07:32 -0700
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05300; Fri, 6 Apr 90 18:08:49 -0700
Received: from coraki.stanford.edu by SAIL.Stanford.EDU with TCP; 6 Apr 90 18:06:45 PDT
Received: by coraki.stanford.edu (4.0/25-eef) id AA02616; Fri, 6 Apr 90 18:07:38 PDT
Message-Id: <9004070107.AA02616@coraki.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Talk by Rob van Glabbeek
Cc: pratt@coraki.stanford.edu
Date: 06 Apr 90 18:07:37 PDT (Fri)
From: pratt@cs.Stanford.EDU
Rob van Glabbeek, of CWI and the Vrije Universiteit of Amsterdam, will
be visiting here next week in connection with the software systems
faculty search. He will give two talks. The first, on Thursday
morning in CIS-101 from 9:30 to 11, will be aimed at a general
audience. It will give some overview of the state of concurrency
modelling, as well as covering some of van Glabbeek's contributions.
The second, to be scheduled some time on Friday, will also be on
concurrency, but will be aimed more at the MTC community here.
What is a good time for the second talk? I have in mind scheduling it
for Friday at 10 am.
Vaughan Pratt
∂14-Apr-90 1402 LOGMTC-mailer sorry and please
Received: from Hudson.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Apr 90 14:01:56 PDT
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA13196; Sat, 14 Apr 90 14:01:16 -0700
Date: Sat, 14 Apr 1990 14:01:15 PDT
From: Yoav Shoham <shoham@Hudson.Stanford.EDU>
To: logmtc@sail.Stanford.EDU
Cc: schwartz@cs.Stanford.EDU
Subject: sorry and please
Message-Id: <CMM.0.88.640126875.shoham@Hudson.Stanford.EDU>
Please ignore the last message. I meant to forward the following request,
initially sent to the wrong machine (p.s.: shouldn't we make sure logic@cs
works as well as @sail?)
----- Transcript of session follows -----
550 logmtc@cs... User unknown
.....
Does anyone have the proceedings of LICS 89 for me to xerox an article from?
Please respond either to me or to Anton, schwartz@cs. Thanks, Yoav
∂16-Apr-90 1023 sweeney@cis.Stanford.EDU EE 310 to be held in AEL 109 this week
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Apr 90 10:21:40 PDT
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Mon, 16 Apr 90 10:17:58 PDT
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA29320; Mon, 16 Apr 90 10:20:59 PDT
Date: Mon, 16 Apr 90 10:20:59 PDT
From: sweeney@cis.stanford.edu (Irene Sweeney)
Message-Id: <9004161720.AA29320@cis.Stanford.EDU>
To: ee-faculty@sierra.Stanford.EDU
Subject: EE 310 to be held in AEL 109 this week
Cc: sweeney@cis.Stanford.EDU
PLEASE NOTE: EE 310 WILL BE HELD IN AEL 109, FOR APRIL 17
EE 310 - APRIL 17
TUESDAY, 4:15 p.m. AEL 109
VAPOR PHASE WAFER CLEANING OXIDE ETCHING AND THIN FILM
GROWTH: TECHNOLOGY FOR THE 1990s
BRUCE DEAL
A novel rector and associated processes are described which involve vapor
phase cleaning and etching of silicon device wafers. The system and
processes replace conventional liquid-type cleaning procedures which have
been used for more than twenty-five years. Vapor phase cleaning and etching
will allow the reduction of device geometries to be continued to the sub-
micrometer level and below during the next decade. After the system is
described, typical data concerning oxide etch rates, native oxide
passivation, and contamination removal (including particles) will be
presented. It also will be shown that this system has the potential for
sequential, integrated processing of multiple cleaning and chemical vapor
deposition device fabrication steps.
∂16-Apr-90 1330 @Sunburn.Stanford.EDU:tcr@sumex-aim.stanford.edu Campus Budget Cut Actions
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Apr 90 13:29:59 PDT
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26434; Mon, 16 Apr 90 13:29:40 -0700
Received: from (KSL-Mac-55.Stanford.EDU) by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA22023; Mon, 16 Apr 90 13:31:17 PDT
Date: Mon, 16 Apr 1990 13:28:52 PST
From: TC Rindfleisch <tcr@sumex-aim.Stanford.EDU>
Subject: Campus Budget Cut Actions
To: KSL-Admin@sumex-aim.stanford.edu, Faculty@cs.stanford.edu,
CSD-Admin@cs.stanford.edu
Cc: tcr@sumex-aim.stanford.edu
Message-Id: <MacMS.30996.5627.tcr@sumex-aim.stanford.edu>
FYI, I've ended up on a couple of advisory groups (those for Information
Resources and Sponsored Projects) for implementation of the $22M campus budget
cuts. The following is an update on what is being considered and I would like
any specific (constructive) comments you would like to have considered. I
already have the thoughts JMC sent around in January.
SPONSORED PROJECTS:
Sorry for the short notice on this one but things are happening fast -- there
is a meeting late this afternoon to discuss SPO cuts totalling 20% of their
annual $1.55M budget. The elements of their proposed cuts include:
Level 1 ($128K)
Eliminate Office Assistant -- currently unfilled
Eliminate Intellectual Property Associate
Eliminate backup for Contract and Grants operations
Level 2 ($40K)
Eliminate Administrative Services group member
Level 3 ($54K)
Discontinue all funding assistance announcements (newsletters, Campus
Report column, manuals/handbooks, etc.)
Level 4 ($92K)
Eliminate 1 of the 7 current contract/grant teams (includes a Contract
Officer and their Assistant)
The most direct effect on our work would seem to come from the Level 3 and 4
cuts, meaning that we will have to ferret out funding opportunities for
ourselves (which we do now anyway?) and there will be additional delays in
processing grant/contract applications and negotiations through SPO. Let me
know if you find either of these unworkable. Overall, I have no idea how the
size of our SPO compares with corresponding offices at competitor schools
(e.g., MIT, Caltech, etc.) nor of a study being done to determine that.
INFORMATION RESOURCES
Bob Street's Information Resources group -- including the Academic Information
Resources (AIR), the Data Center (IBM mainframes -- remnants of Ed Shaw's
operation), and Telecommunications and Networking -- is targeted to take an
overall 15% cut. Tentatively, this will be distributed 18% to AIR, 25% to the
Data Center, 10% to Telecom/Networks, and 25% to the IR central office. I will
get more specifics about IR cut options later this week. Let me know if you
think there are particularly egregious areas of IR operations that warrant
streamlining. Bob Street has had Bill Arms (CMU) and someone from MIT visit
recently to assess and advise on the scope of SU IR activities as compared with
those at competitor schools.
Tom R.
-------
∂16-Apr-90 1357 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGACT News -- deadline reminder
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Apr 90 13:57:03 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00327; Mon, 16 Apr 90 13:57:10 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27305; Mon, 16 Apr 90 13:56:22 -0700
Message-Id: <9004162056.AA27305@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4206; Mon, 16 Apr 90 15:21:26 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4153; Mon, 16 Apr 90 15:21:15 CDT
Date: Mon, 16 Apr 90 15:17:45 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Mike Langston <langston@cs.utk.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Mike Langston <langston%cs.utk.edu@VM1.NoDak.EDU>
Subject: SIGACT News -- deadline reminder
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
This is to remind potential contributors that May 1 is the deadline
for the Spring 1990 issue of SIGACT News. Items received after that
date will not be considered for publication in this issue.
Mike Langston
∂16-Apr-90 1402 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Second Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Apr 90 14:01:50 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00673; Mon, 16 Apr 90 14:00:00 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27312; Mon, 16 Apr 90 13:57:11 -0700
Message-Id: <9004162057.AA27312@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4634; Mon, 16 Apr 90 15:27:43 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4612; Mon, 16 Apr 90 15:27:39 CDT
Date: Mon, 16 Apr 90 15:26:33 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Chic Rattray <cr@compsci.stirling.ac.uk>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Chic Rattray <cr%CS.STIR.AC.UK@VM1.NoDak.EDU>
Subject: Second Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
FINAL CALL FOR PAPERS
The Institute of Mathematics and Its Applications
IMA Conference
on the
UNIFIED COMPUTATION LABORATORY
3 - 6 July 1990
University of Stirling, Scotland
The systematic study of software development has led to a wide variety
of different approaches, theories, concepts, and tools, applicable to
each stage in the specification and construction of complex software
systems, to a formal view of the development process, and to the
evolution of such systems. This diversity is often illusionary and
many approaches have a common framework and a common underlying
mathematical basis. This Conference aims to provide a forum in which
to discuss the different approaches and to consider possible unifying
frameworks for program construction theories, system structures and
the specification, design and development of future software construction
environments.
Papers are invited on: surveys, original research, practical experience
with methods, tools and environments.
Topic areas include (but are not limited to): (meta-)models of software,
software specification and construction, the development process; models
for re-usability; program construction calculi; term rewriting systems,
transformation systems; analogical and inductive reasoning systems for
software development; mathematical frameworks (logical, categorical,
.. ).
The Conference will include a number of talks by invited speakers.
There will be an opportunity for small group evening sessions on specialist
topics. Those interested should contact:
Charles Rattray
Department of Computing Science
University of Stirling
STIRLING
Scotland FK9 4LA
UK
e_mail (JANET): cr@uk.ac.stir.cs
Fax: 0786 63000 (UK)
+44 786 63000 (International)
Tele: 0786 73171 (UK)
+44 786 73171 (International)
If you wish to submit a paper, please send an extended abstract (5-7 pages)
to the above address by 30th April 1990. Notification of acceptance will be
posted to the selected authors by 14th May 1990. Conference proceedings
are to be published in the IMA Conference Proceedings Series. Full papers
must be available at the start of the Conference.
The Conference will be held in the University of Stirling, with accommodation
provided in halls of residence. The Stirling campus, one of the most
attractive in Europe, is situated on the outskirts of Stirling - the ancient
capital of Scotland - and is within easy reach of Edinburgh and Glasgow by
road and rail. Direct flights to these cities from many continental
European airports are available daily; direct flights from the USA normally
arrive at Prestwich(or, perhaps, Glasgow). The alternative is to fly via London.
Further details are available from:
Miss Pamela Irving
Conference Officer
The Institute of Mathematics and Its Applications
Maitland House
Warrior Square
Southend-on-Sea
Essex SS1 2JY, UK.
tele: 0702 612177
Fax: 0702 612610
------------------------------------
UNIFIED COMPUTATION LABORATORY Conference
University of Stirling, Scotland
3 - 6 July 1990
Please send me .... copies of further information.
I shall be attending the Conference: ....(Yes) ....(No)
I intend to submit a paper(abstract) provisionally titled:
.........................................................
.........................................................
Name: ....................................................
Address: .................................................
.................................................
.................................................
.................................................
Telephone: .....................
Telex: .....................
Fax: .....................
E_mail: .....................
Return this information to:
Miss Pamela Irving, Conference Officer, The Institute of Mathematics and
Its Applications, Maitland House, Warrior Square, Southend-on-Sea,
Essex SS1 2JY, UK.
∂16-Apr-90 1718 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Bell Fellowship announcement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Apr 90 17:18:24 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04461; Mon, 16 Apr 90 17:03:53 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA22116; Mon, 16 Apr 90 17:02:12 -0700
Date: Mon, 16 Apr 1990 17:02:10 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU, mkatz@cs.Stanford.EDU, alevy@cs.Stanford.EDU,
maydan@cs.Stanford.EDU
Subject: Bell Fellowship announcement
Message-Id: <CMM.0.88.640310530.tajnai@Hudson.Stanford.EDU>
We offer our congratulations to Dror Maydan, who is has been selected
by AT&T Bell Labs to receive a 4-year PHD scholarship.
We submitted 3 outstanding candidates, and we knew only one could win.
I regret there were not 3 fellowshps.
Carolyn Tajnai
∂16-Apr-90 1838 grossman@Sunburn.Stanford.EDU [Cindy_Larson@NeXT.COM: NeXT machine theft]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 Apr 90 18:38:29 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA06860; Mon, 16 Apr 90 18:24:42 -0700
Date: Mon, 16 Apr 90 18:24:42 -0700
From: Stu Grossman <grossman@Sunburn.Stanford.EDU>
Message-Id: <9004170124.AA06860@Sunburn.Stanford.EDU>
To: su-computers@Sunburn.Stanford.EDU, csd-list@Sunburn.Stanford.EDU
Subject: [Cindy_Larson@NeXT.COM: NeXT machine theft]
I hate to say this, but your computer is probably next... Be careful, and lock
it down.
Stu
Return-Path: <@jessica.Stanford.EDU:Cindy_Larson@NeXT.COM>
Date: Mon, 16 Apr 90 14:05:06 PST
From: Cindy_Larson@NeXT.COM
To: next-info@air.stanford.edu
Subject: NeXT machine theft
Begin forwarded message:
Date: Mon, 16 Apr 90 14:37:10 PDT
>From: Michael_McNabb
To: next
Subject: NeXT machine theft
Last Friday night, the Center for Computer Research in Music and
Acoustics at Stanford University was broken into and three NeXT
machines stolen. The thieves left behind a Mac II, a DX7
synthesizer, and other equipment. Only the NeXTs were taken,
along with several optical disks. The machines were not visible
from the outside. Stanford Police believe there was more than
one thief.
Here are the serial numbers of the machines:
Cubes: AAK0000953
AAK0000974
AAK0000975
Monitors: AAA5001276
AAA5001279
AAA5001283
Keyboards: AAE8500318
AAE8500485
AAE8500773
Please notify Stanford Police at (415) 723-9633 of any sightings or other information.
∂17-Apr-90 0901 INAN@STAR5.STANFORD.EDU Electromagnetics curriculum --
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 09:01:45 PDT
Received: from STAR5.STANFORD.EDU by sierra.Stanford.EDU (4.1/4.7); Tue, 17 Apr 90 08:56:35 PDT
Date: Tue 17 Apr 90 08:59:13-PDT
From: Umran Inan <INAN@STAR5.STANFORD.EDU>
Subject: Electromagnetics curriculum --
To: ee-faculty@sierra.stanford.edu
Message-Id: <640367953.180000.INAN@STAR5.STANFORD.EDU>
Mail-System-Version: <VAX-MM(254)+TOPSLIB(138)+PONY(225)@STAR5.STANFORD.EDU>
Dear Friends,
I have received very few responses to my circulation (dated 3 April)
concerning the revision of the electromagnetics curriculum. Could I ask
you once again to take five minutes to look through the package and fill
out and return the enclosed form. Please also note that I am asking for
course outlines and other information from those of you teaching the
courses listed on page 2 of the package.
I realize that curriculum
revision is not a high priority for most of us, however, please realize
that we do not do this very often and faculty inputs are our only
resource. Once I receive your inputs, I will be organizing a luncheon
gathering of those interested to kick around some ideas. Thanks.
--Umran Inan
-------
∂17-Apr-90 0924 helen@russell.Stanford.EDU internships
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 09:24:30 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA10894; Tue, 17 Apr 90 09:23:58 PDT
Date: Tue 17 Apr 90 09:23:57-PDT
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: internships
To: ssp-students@russell.Stanford.EDU, ssp-faculty@russell.Stanford.EDU
Message-Id: <640373037.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
This is a reminder that the internship applications were due yesterday.
If you were planning to submit something but have not yet handed it in,
let us know immediately.
--Helen
-------
∂17-Apr-90 1012 grundy@csli.Stanford.EDU Symbolic Systems Forum April 19
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 10:12:16 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA14692; Tue, 17 Apr 90 10:05:27 PDT
Date: Tue 17 Apr 90 10:05:24-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum April 19
To: grundy@csli.Stanford.EDU
Message-Id: <640375524.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, April 19, 1990
Cordura Hall conference room, 3:30 pm
NOTE TIME AND PLACE CHANGE (This week only)
Speaker: Stanley Peters, Director of CSLI
Topic: "Overview of Research at the Center for the Study of
Language and Information"
ABSTRACT
--------
The Center for the Study of Language and Information
(CSLI) is an institute that focuses on basic research on
language and information. Its members are Stanford faculty
and graduate students from the departments of computer
science, linguistics, philosophy, and psychology, as well as
researches from Bay Area industrial research centers
including SRI International, Xerox PARC, and Hewlett-
Packard, and visiting scholars from the United States and
around the world. There is significant overlap in the
content area that CSLI covers in its research and that which
SSP covers in its educational program. In addition, a large
proportion of SSP's faculty are affiliated with CSLI.
Stanley Peters, the director of CSLI, will give an
outline of some of CSLI's current research projects. The
meeting will be held at CSLI, in the conference room at
Cordura Hall, located at the corner of Panama and Campus
Drive. Before the talk begins at 4:15 there will be an
informal happy hour (for forty-five minutes) starting at
3:30, with refreshments of an unusually high caliber.
Don't forget the
MAJORS EVENT
on Wednesday, April 18.
Please stop by the Symbolic Systems table in front of
building 60. If you're interested in helping out at the
table, send a note to Jennifer Cotelleer (jac@jessica).
Next week at the forum, April 26:
Jon Barwise, Philosophy
"Applications of Non-wellfounded Sets in Symbolic
Systems"
If you would like to be added to the Symbolic Systems Forum
mailing list, send a note to Bill Grundy (grundy@csli).
-------
∂17-Apr-90 1055 grundy@csli.Stanford.EDU Clarification on Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 10:55:45 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA17021; Tue, 17 Apr 90 10:48:24 PDT
Date: Tue 17 Apr 90 10:48:22-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Clarification on Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <640378102.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
As you may have, noticed, there have been conflicting announcements regarding
the forum this Thursday. To clarify, the forum this week will be preceded by
an informal meeting with refreshments starting at 3:30. The talk, given by
Stanley Peters, will begin at 4:15. The talk will outline several research
projects going on at CSLI, and will include a tour of the facilities as well
as some demos.
Bill
-------
∂17-Apr-90 1150 mrg@Sunburn.Stanford.EDU phd evaluation
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 11:50:47 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20006; Tue, 17 Apr 90 11:50:31 -0700
Date: Tue, 17 Apr 1990 11:50:31 PDT
From: Michael Genesereth <mrg@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: phd evaluation
Message-Id: <CMM.0.88.640378231.mrg@Sunburn.Stanford.EDU>
Folks,
Time once again to give us some feedback on teh progress of
your phd students. We are enclosing below a list of all students
in department sorted by advisor. Please send aleta a note
(akhtar@sunburn) with your evaluation of those students for
whom you are listed as primary advisor.
In addition to your informal evaluation, we are requesting that you
supply a coarse numerical evaluation as well. We will use this info
in future years in trying to correlate progress through the program
with admissions data. For now, we just want to gather the data.
Your evaluation should be an integer between 1 and 5 inclusive. It
should be based on Stanford CS phd students only. Thus, the standard
Stanford CS student making reasonable progress in the program shhould
be given a 3 (assuming there is any such thing as a 'standard'
student). Someone who is distinctly below average should get a 2. A
1 means that the persons pogress is wholly inadequate and, if continued
for much longer, should lead to dismissal. A 4 means that the student
is making exceptional progress, distinctly above average phd
performance. A 5 means that he person is a superstar, has just proved
p/=np, and has decided it was just a lemma for a more important
theorem.
Please be careful in evaluating a student's performance that you not
confuse educational progress with external rewards. For example, one
student might be making excellent progress yet produce no papers
or programs that quarter, while another student might be goofing off
yet his paper from the last quarter just got published. However, be
sure that you base your evaluation on information you have gotten from
the student in some way. No information should suggest no progress
unless you have reason to believe the contrary.
Thanks.
mrg
Advisor Students
Binford Frants Leonid
Buchanan Schoen Eric
Cheriton Frederick Ronald A
Cheriton Gray Cary G.
Cheriton Greenwald Michael B
Cheriton Williamson Carey
Dill Hu Alan J.
Dill Nowick Steven
Dill Wong-Toi Howard
Feigenbaum Guha Ramanathan V.
Feigenbaum Mohammed John
Feigenbaum Nayak P. Pandurang
Feigenbaum Peyton Liam
Floyd Hayes Barry
Genesereth Baker Andrew B.
Genesereth Berglund Eric J.
Genesereth Hsu Yung-Jen
Genesereth Woodfill John
Ginsberg Harvey William
Goldberg Cohen Edith
Goldberg Kennedy James Robert
Goldberg Kharitonov Michael
Goldberg Listgarten Sheralyn
Goldberg Merchant Arif A.
Goldberg Radzik Tomasz
Golub Ponceleon Dulce B.
Guibas Andivahis Dimitrios
Guibas Friedman Joseph
Guibas Salesin David H.
Guibas Snoeyink Jack Scott
Gupta Hailperin Max
Gupta Menezes Arul A.
Gupta Rothberg Edward E.
Gupta Tucker Andrew G.
Halpern Grove Adam J.
Halpern Koller Daphne
Hayes-Roth Ash David
Hayes-Roth Chang Edward
Hayes-Roth Murdock Janet L.
Hayes-Roth Washington Richard M.
Hayes-Roth Wolverton Michael J.
Hennessy Blatt Miriam G.
Hennessy Chandra Rohit
Hennessy Davis Helen
Hennessy Goldberg Aaron J
Hennessy Maydan Dror E.
Hennessy Pieper Karen L.
Hennessy Tjiang Weng Kiang
Hennessy Wolf Michael E.
Knuth Feder Tomas
Knuth Gangolli Anil R.
Knuth Haddad Ramsey
Lam Anderson Jennifer-Ann
Lam Drexler Andreas J. (changing)
Lam Rinard Martin C.
Latombe Jones David G.
Latombe Lazanas Anthony
Latombe Quinlan Sean
Latombe Strat Thomas
Latombe Wilson Randall H
Latombe Zhu David J.
Linton Burns Derrick R.
Linton Kavraki Lydia E.
Luckham Madhav Neel
Manna Alur Rajeev S
Manna Cyrluk David A
Manna Henzinger Thomas A.
Manna McGuire Hugh W.
Mayr Subramanian Ashok
Mayr Wang Alexander
McCarthy Scales Daniel J.
McCarthy Zabih Ramin
Meng Hung Andy C.
Mitchell Howard Brian T
Mitchell Katiyar Dinesh
Mitchell Lincoln Patrick D.
Mitchell Wolf Elizabeth S
Mont-Reynaud Mellinger David K.
Motwani Phillips Steven J.
Nilsson Christensen Jens
Nilsson Grosof Benjamin N.
Nilsson Dixon Michael D. (nominal advisor)
Nilsson Geddis Donald F.
Nilsson Kaelbling Leslie P.
Nilsson Kosoresow Andrew Peter
Nilsson Levy Alon Y.
Nilsson Moore Rebecca
Nilsson Myers Karen L.
Nilsson Paek Eunok
Nilsson Roy H. Scott
Nilsson Young R. Michael
Oliger Suhr Steven C.
Pratt Avrahami Gideon
Pratt Casley Ross
Pratt Crew Roger F.
Pratt Gupta Vineet
Pratt Torng Eric K
Rosenbloom Golding Andrew
Rosenbloom Unruh Amy
Shoham Darwiche Adnan Y
Shoham Goyal Nita
Shoham Lin Fangzhen
Shoham Mozes Eyal
Shoham Schwartz Anton
Shoham Thomas Becky
Ullman Derr Marcia A.
Ullman Freeman J. Andrew
Ullman Gupta Ashish
Ullman Jakobsson Hakan
Ullman Morris Katherine A.
Ullman Mumick Inderpal Singh
Ullman Phipps Geoffrey
Ullman Plambeck Thane E.
Ullman Ross Ken
Ullman Saraiya Yatin P.
Ullman Torres Alberto
Ullman Waarts Orli
Ungar Chambers Craig D.
Ungar Hoelzle Urs
Waldinger Traugott Jonathan C.
Weise Conybeare Roland
Weise Kanamori Atsushi
Weise Katz Morris J.
Weise Rokicki Tomas G.
Weise Seligman Scott
Wiederhold Hall Keith
Wiederhold Rathmann Peter K.
Wiederhold Roy Shaibal
∂17-Apr-90 2118 LOGMTC-mailer Seminar in Logic and Foundations
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 21:18:06 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA22141; Tue, 17 Apr 90 21:20:19 PDT
Date: Tue, 17 Apr 1990 21:20:18 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.640412418.sf@csli.stanford.edu>
Speaker: Prof. Yuri Matijasevich, Steklov Institute of Mathematics, Leningrad
Title: "Real numbers and
realUUUUUUUUUUUUiUUUUUUUUUUUiUUUUUUUUUUUiUUUUUUUUUUUiUUUUUUUUUUUiU
UUUUUUUUUUiU
∂17-Apr-90 2125 LOGMTC-mailer Seminar in Logic and Foundations
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 21:25:45 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA22530; Tue, 17 Apr 90 21:27:54 PDT
Date: Tue, 17 Apr 1990 21:27:53 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.640412873.sf@csli.stanford.edu>
Speaker: Prof. Yuri Matijasevich, Steklov Institute of Mathematics, Leningrad
Title: "Real numbers and real computers"
Time: Monday April 23, 4:15-5:30 PM
Place: Room 381-T, Math Corner, Stanford
Abstract to follow.
A dinner out with the speaker is planned following the talk.
Prof. Matijasevich will give a second lecture on another topic on
Wednesday May 2 at 4:15 PM. Title and place to be announced.
S. Feferman
∂17-Apr-90 2146 axwang@Theory.Stanford.EDU Problem Session
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 Apr 90 21:46:12 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA03533; Tue, 17 Apr 90 21:39:31 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04507; Tue, 17 Apr 90 21:44:23 -0700
Message-Id: <9004180444.AA04507@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: Problem Session
Date: Tue, 17 Apr 90 21:44:18 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
There will be no speaker at AFLB this Thursday. Instead, this week's
AFLB will feature a problem session. AFLB will meet at the usual time
and place: 12:00pm, Thursday, MJH 252.
∂18-Apr-90 0950 LOGMTC-mailer MSRI Seminar Announcements, April 23-27
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 18 Apr 90 09:50:05 PDT
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA08554; Wed, 18 Apr 90 09:48:21 PDT
Received: by msri.org (4.0/SMI-4.0)
id AA02309; Wed, 18 Apr 90 09:45:21 PDT
Date: Wed, 18 Apr 90 09:45:21 PDT
From: david@msri.org (David Mostardi)
Message-Id: <9004181645.AA02309@msri.org>
To: weekly@msri.org
Subject: MSRI Seminar Announcements, April 23-27
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Seminar Announcements for April 23 - 27, 1990
Monday, April 23
RECURSION THEORY 11:00 MSRI Lecture Hall
A. Nies "Recursively Enumerable Equivalence Relations"
MSRI-EVANS MONDAY LECTURE 4:15 60 Evans Hall
R. Schultz "Manifolds with Metrics of Positive Scalar Curvature"
Tuesday, April 24
INFORMAL CORE MODEL SEMINAR 10:30 MSRI Seminar Room
P. D. Welch "Fine Structure" VIII
MODEL THEORY 1:00 MSRI Seminar Room
A. Lachlan "Prime Models of Complete Coinductive Theories"
ALGEBRAIC TOPOLOGY 2:15 MSRI Lecture Hall
W.-C. Hsiang "Computation of Cyclotomic Trace" II
SET THEORY 3:30 MSRI Lecture Hall
M. Foreman "Paradoxical Decompositions of the Sphere Using Nice Pieces;
A Solution to the Marczewski Problem"
Wednesday, April 25
ALGEBRAIC TOPOLOGY 2:15 MSRI Lecture Hall
J. Rognes "Rank Filtration of Algebraic K-Theory"
Thursday, April 26
CROSS CULTURAL 11:00 MSRI Lecture Hall
A. Kechris "Descriptive Aspects of Borel Group Actions and Equivalence Relations" IV
CENTER FOR PURE & APPLIED MATHEMATICS LUNCH TALK 12:10 (Bring your lunch)
J. Searle " Philosophy: Is the Brain a Digital Computer?" 12:45 Faculty Club Conf. Rm.
MODEL THEORY 1:00 MSRI Seminar Room
J. Loveys "Wet Models"
ALGEBRAIC K-THEORY 2:15 MSRI Lecture Hall
W.-C. Hsiang "Computation of Cyclotomic Trace" III
INFORMAL CORE MODEL SEMINAR 2:30 MSRI Seminar Room
P. D. Welch "Fine Structure" IX
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
D. Sarason "Inner Functions: 'What's So Great About Them?' "
Friday, April 27
NO LECTURES SCHEDULED FOR TODAY
∂18-Apr-90 1002 chandler@Sunburn.Stanford.EDU 1990 Commencement Marshals
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 10:02:35 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13603; Wed, 18 Apr 90 10:02:41 -0700
Date: Wed, 18 Apr 1990 10:02:41 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: 1990 Commencement Marshals
Message-Id: <CMM.0.88.640458161.chandler@Sunburn.Stanford.EDU>
The School of Engineering has asked if any of our faculty would be interested
in serving as Marshall at commencement. The job of Marshall involves one
"dry run" on Friday, June 16, and then attendance at the actual ceremony on
Sunday, June 17.
Please let me know by April 23rd if you are interested.
Thanks.
∂18-Apr-90 1020 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Second International School for Computer Science Researchers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 10:20:32 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22719; Wed, 18 Apr 90 10:20:48 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14019; Wed, 18 Apr 90 10:19:34 -0700
Message-Id: <9004181719.AA14019@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7487; Wed, 18 Apr 90 12:17:18 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7456; Wed, 18 Apr 90 12:17:14 CDT
Date: Wed, 18 Apr 90 12:16:13 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Marco Pellegrini <pellegri@csd28.NYU.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Marco Pellegrini <pellegri%csd28.NYU.EDU@VM1.NoDak.EDU>
Subject: Second International School for Computer Science Researchers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Second International School for Computer Science Researchers
Sponsored by the European Association for Theoretical Computer Science
Acireale, Italy, 18-30 June 1990
Following the success of the first school held in 1989, the
Sicilian town of Acireale, at the foot of the vulcano Etna, will
be the home of the Second International School for Computer Science
Researchers, with the scientific sponsorship of EATCS, and funding
from public Italian sources. The subject for 1990 is Algorithms
and Complexity.
The school is open to about thirty Ph.D. students and young researchers
in CS and Mathematics, from different Universities and Research
Institutions. It will consist of six one-week courses of seven
hours each, at intensive graduate level. The official language is
English. Participants will be required to attend four courses out
of six, and to obtain a statement of proficiency. Course schedule
is as a follows:
1st week: 18-23 June 90
Introduction to Complexity Theory Hartmanis (Cornell)
Randomized Algorithms Rabin (Harvard and
Jerusalem)
Computational Geometry Preparata (Illinois)
2nd week: 25-30 June 90
Circuit Complexity Sipser (MIT)
Criptography Micali (MIT)
Robotics Algorithms Schwartz (Courant)
The school will be held in a hotel, where both lecturers and students
will reside to ease informal contacts. In principle the lectures
will take place in the morning, and the afternoons will be devoted
to general discussions and individual study. All the accepted
participants will have their living expenses covered by the school
organization.
A letter of application must be sent to Professor Alfredo Ferro
(address below), and must be received by May 15, 1990. The application
must specify age, academic degrees, name of advisor (for Ph.D.
students), and contain a brief scientific curriculum, and a statement
explaining the interest in the school.
Fabrizio Luccio Alfredo Ferro
University of Pisa University of Catania
(Scientific coordination) (General organization)
Apply to: Professor Alfredo Ferro
Dipartimento di Matematica, Universita' di Catania
V.le A. Doria, 6 - 95125 Catania - Italy
Fax+39 95 222291
E-MAIL: MI3CTG51@ICINECA.BITNET
∂18-Apr-90 1031 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU University of Paderborn -- List of talks
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 10:31:09 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23315; Wed, 18 Apr 90 10:30:57 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14431; Wed, 18 Apr 90 10:29:30 -0700
Message-Id: <9004181729.AA14431@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8102; Wed, 18 Apr 90 12:22:39 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8034; Wed, 18 Apr 90 12:22:36 CDT
Date: Wed, 18 Apr 90 12:20:11 CDT
Reply-To: Theory-B - TheoryNet Ongoing Seminars and Lectures
<THEORY-B@NDSUVM1.Stanford.EDU>,
Rolf Wanka <wanka@pbinfo.uni-paderborn.de>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-B@NDSUVM1
From: Rolf Wanka <wanka%pbinfo.uni-paderborn.de@VM1.NoDak.EDU>
Subject: University of Paderborn -- List of talks
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Here at the University of Paderborn is the new service of sending lists
(by e-mail) of the talks held by national and international visitors,
Ph.D. students and undergratuate students at our faculty of computer science.
People who want to know, what the fields of research activities at our
university are, and who can read German, are invited to send me a mail
to request that list.
Regards
Rolf Wanka
---------------------------------------------------------------------------
Rolf Wanka | e-mail:
Universitaet-GH Paderborn | wanka@pbinfo.UUCP
Fachbereich 17-Mathematik/Informatik | or wanka@pbinfo.uni-paderborn.de
Warburger Str. 100 | or ...!uunet!unido!pbinfo!wanka
D-4790 Paderborn, West Germany |
---------------------------------------------------------------------------
PS: Here you see a (shortened) sample:
UNIVERSITAET-GH PADERBORN Stand: 17.04.90
Fachbereich Mathematik/Informatik Liste: 4/1990
[... some talks deleted ...]
-----------------------------------------------------------------
2. Mai 1990 (Mittwoch), 14:00 Uhr, Raum P 1516.2
Oberseminar, AG Meyer auf der Heide
Bernd Schmeltz, Technische Hochschule Darmstadt
Lernen von konvexen Koerpern
-----------------------------------------------------------------
3. Mai 1990 (Donnerstag), 16:00 Uhr, Raum D1.338
Oberseminar, AG Lengauer
Joerg Heistermann, Universitaet-GH Paderborn
Kontextsensitive Torus-Kompaktierung
-----------------------------------------------------------------
8. Mai 1990 (Dienstag), 17:45 Uhr, Hoersaal D2
Kolloquium des FB Mathematik/Informatik
Prof. Dr. Christian Lengauer, University of Edinburgh
Systolisierende Kompilation
-----------------------------------------------------------------
9. Mai 1990 (Mittwoch), 16:00 Uhr, Raum D3.344
Oberseminar Praktische Informatik (AG Kastens, AG Rammig)
Prof. Hammer, Akademie der Wissenschaften Ost-Berlin
Aus dem Bereich Verlaessliche Rechnersysteme und/oder
Integrierte Programmsysteme
-----------------------------------------------------------------
[... more talks deleted ...]
∂18-Apr-90 1033 dietrich@sierra.Stanford.EDU Quarterly Reminder - Research Offsets
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 10:33:35 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Wed, 18 Apr 90 10:28:40 PDT
Date: Wed, 18 Apr 90 10:28:40 PDT
From: dietrich@sierra.Stanford.EDU (Katherine F. Dietrich)
To: ee-faculty@sierra.Stanford.EDU
Cc: dietrich@sierra.Stanford.EDU
Subject: Quarterly Reminder - Research Offsets
Message-Id: <CMM.0.88.640459719.dietrich@>
If you need to make any changes for Spring Quarter on your
teaching and offset planning sheet, please let me know as
soon as possible. All research offset changes must come
through this office first. I will, in turn, notify EERA
of any change.
Kathy Dietrich
∂18-Apr-90 1311 chandler@Sunburn.Stanford.EDU ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : 1990
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 13:11:11 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19835; Wed, 18 Apr 90 13:11:08 -0700
Date: Wed, 18 Apr 1990 13:11:08 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: ["Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU> : 1990
Commencement Marshals ]
Message-Id: <CMM.0.88.640469468.chandler@Sunburn.Stanford.EDU>
Just noticed an error in my previous message. The "dry run" is on Friday,
June 15.
---------------
Return-Path: <chandler>
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13603; Wed, 18 Apr 90 10:02:41 -0700
Full-Name: Joyce R. Chandler
Date: Wed, 18 Apr 1990 10:02:41 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: 1990 Commencement Marshals
Message-Id: <CMM.0.88.640458161.chandler@Sunburn.Stanford.EDU>
The School of Engineering has asked if any of our faculty would be interested
in serving as Marshall at commencement. The job of Marshall involves one
"dry run" on Friday, June 16, and then attendance at the actual ceremony on
Sunday, June 17.
Please let me know by April 23rd if you are interested.
Thanks.
∂18-Apr-90 1323 jones@Sunburn.Stanford.EDU Virtual Reality
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 13:23:05 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20305; Wed, 18 Apr 90 13:23:17 -0700
Date: Wed, 18 Apr 1990 13:23:17 PDT
From: "H. Roy Jones" <jones@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Virtual Reality
Message-Id: <CMM.0.88.640470197.jones@Sunburn.Stanford.EDU>
I remember someone talking about virtual realities the other day. One of the
top high school students in the country (he finished 8th out of 1400 in the
Westinghouse science talent search) is coming here Friday and supposedly read
a paper from someone here on this topic. I'd like to find out more and
possibly arrange a meeting if you're willing.
Thanks,
Roy
∂18-Apr-90 1400 chandler@Sunburn.Stanford.EDU PLEASE RSVP!!!!!!
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 14:00:46 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA21814; Wed, 18 Apr 90 14:01:25 -0700
Date: Wed, 18 Apr 1990 14:01:24 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: retreatattendees1990@cs.Stanford.EDU
Subject: PLEASE RSVP!!!!!!
Message-Id: <CMM.0.88.640472484.chandler@Sunburn.Stanford.EDU>
Following is a list of retreat-1990 attendees. Please check to see if the
information I have is correct. If you have not already told me so, please
let me know what your plans are for dinner on Friday. Also, Please let me
know if you will be having dinner with the group on Saturday.
You can simply edit this list and shoot it back to me.
Thanks much for your cooperation.
Joyce
CSD FACULTY RETREAT - MAY 4-6, 1990
ATTENDEES
NAME ACCOMMODATIONS DINNER FRI. DINNER SAT.
Binford Single Friday and Saturday No
Genesereth Single Friday and Saturday Yes
Khatib Single Friday and Saturday No
Latombe Single Friday and Saturday Yes
McCarthy Single Friday and Saturday No
Nilsson Single Friday and Saturday Yes
Oliger Single Friday and Saturday Yes
Pratt Single Friday and Saturday ???
Koza Single Friday and Saturday Yes
Ungar Single Friday and Saturday Yes
Wheaton Single Friday and Saturday Yes
Englemore Double Fri. share w/Feigenbaum Yes
Feigenbaum Double Fri. share w/Engelmore Yes
Geddis Dble. Fri/Sat, share w/Singh Yes
Singh Dble. Fri/Sat, share w/Geddis Yes
Goldberg Dble. Fri/Sat, share w/Plotkin Yes
Plotkin Dble. Fri/Sat, share w/Goldberg Yes
Hayes-Roth Dble. Fri/Sat, share w/Lam Yes
Lam Dble. Fri/Sat, share w/Hayes-Roth Yes
Winograd Dble. Fri/Sat, share w/Shoham Yes
Shoham Dble. Fri/Sat, share w/Winograd ???
Knuth Dble. Fri/Sat, share w/Lifschitz Yes
Lifschitz Dble. Fri/Sat, share w/Knuth Yes
Jones Dble. Fri/Sat, share w/Fisher Yes
Fisher Dble. Fri/Sat, share w/Jones Yes
Dill Dble. Fri/Sat, share w/Mitchell Yes
Mitchell Dble. Fri/Sat, share w/Dill No
Luo Single Friday and Saturday Yes
Mont-Reynaud Single Friday and Saturday No
Motwani Single Friday and Saturday No
Gorin Single Friday and Saturday Yes
Roberts, Eric Single Friday and Saturday ???
Hayes Dble. Sat, share w/Weise No
Weise Single Fri. Dble. Sat, share w/ Yes
Hayes
DAY GUESTS:
Ullman Saturday and Sunday Yes
Gupta Saturday No
∂18-Apr-90 1551 LOGMTC-mailer seminar abstract
Received: from Hudson.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 15:51:40 PDT
Received: from gauss.Stanford.EDU by Hudson.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02758; Wed, 18 Apr 90 15:50:52 -0700
Message-Id: <9004182250.AA02758@Hudson.Stanford.EDU>
Received: by gauss.stanford.edu (3.2/4.7); Wed, 18 Apr 90 15:52:15 PDT
Date: Wed, 18 Apr 90 15:52:15 PDT
From: matija@gauss.Stanford.EDU (Yuri Matijasevich)
To: logmtc%sail@hudson.Stanford.EDU
Subject: seminar abstract
Yuri MATIJASEVICH
Steklov Institute of Mathematics (Leningrad)
REAL NUMBERS AND REAL COMPUTERS
Monday, April 23
As soon as real numbers are involved as inputs and outputs in a
long calculations, it is usually rather difficult to establish
mathematically rigourous statements about the relations between inputs
and outputs, in particular, due to roundoff in arithmetical operations.
Three techniques wiil be presented for obtaining automatically not
only approximate value of the desired result, but also a mathematically
rigourous bounds for possible errors. The third of the techniques
employs a fast method for calculating partial derivatives.
∂18-Apr-90 1558 LOGMTC-mailer
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 15:58:20 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA06955; Wed, 18 Apr 90 16:00:29 PDT
Date: Wed, 18 Apr 1990 16:00:22 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Message-Id: <CMM.0.88.640479622.sf@csli.stanford.edu>
Return-Path: <matija@gauss.stanford.edu>
Received: from gauss.stanford.edu by csli.Stanford.EDU (4.1/inc-1.0)
id AA23240; Wed, 18 Apr 90 11:59:35 PDT
Message-Id: <9004181859.AA23240@csli.Stanford.EDU>
Received: by gauss.stanford.edu (3.2/4.7); Wed, 18 Apr 90 11:58:01 PDT
Date: Wed, 18 Apr 90 11:58:01 PDT
>From: matija@gauss.stanford.edu (Yuri Matijasevich)
To: sf@csli.stanford.edu
Yuri MATIJASEVICH
Steklov Institute of Mathematics (Leningrad)
REAL NUMBERS AND REAL COMPUTERS
Monday, April 23
As soon as real numbers are involved as inputs and outputs in a
long calculations, it is usually rather difficult to establish
mathematically rigourous statements about the relations between inputs
and outputs, in particular, due to roundoff in arithmetical operations.
Three techniques wiil be presented for obtaining automatically not
only approximate value of the desired result, but also a mathematically
rigourous bounds for possible errors. The third of the techniques
employs a fast method for calculating partial derivatives.
∂18-Apr-90 1709 ingrid@russell.Stanford.EDU CSLI Calendar, 19 April, vol 5:24
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 Apr 90 17:08:10 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA26376; Wed, 18 Apr 90 15:55:31 PDT
Date: Wed, 18 Apr 90 15:55:31 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004182255.AA26376@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 19 April, vol 5:24
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
19 April 1990 Stanford Vol. 5, No. 24
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 19 APRIL 1990
12:00 noon TINLunch
Cordura 100 Reading: Harmonic Grammar -- A Formal Multi-Level
Connectionist Theory of Linguistic Well-Formedness:
An Application
by Ge'raldine Legendre, Yoshiro Miyata, and
Paul Smolensky
Discussion led by Stanley Peters
(peters@csli.stanford.edu)
Abstract in last week's Calendar
CSLI Seminar
Controversies in Natural-Language Research 2
led by Stanley Peters
(peters@csli.stanford.edu)
DUE TO THE UNAVAILABILITY OF THE SPEAKERS,
THIS SEMINAR HAS BEEN POSTPONED BY ONE WEEK
(SEE BELOW)
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 26 APRIL 1990
12:00 noon TINLunch
Cordura 100 Truth Makers for Modal Propositions
Bernard Linsky
Visiting Scholar from the University of Alberta
(linsky@csli.stanford.edu)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 2
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Developments in Phonological and
Morphological Theory
Speakers: Paul Kiparsky and Bill Poser
(kiparsky@csli.stanford.edu, poser@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Truth Makers for Modal Propositions
Bernard Linsky
This paper is a survey of different metaphysical accounts of what it
is in the world that _makes_ modal propositions true. Alternatives
that are considered include: relations between objects, worlds, and
properties, properties of states of affairs or situations, and
possible facts. I conclude that a correspondence theory of truth for
modal propositions requires possible and actual facts, as well as
facts that involve these facts as constituents. The notion of _Truth
Makers_ is taken from John Bigelow and John Fox, and the views of
another "Australian" philosopher, David Lewis, are also discussed.
____________
NEXT WEEK'S CSLI SEMINAR
Developments in Phonological and Morphological Theory
Paul Kiparsky and Bill Poser
_The Sound Pattern of English_, the work underlying virtually all
present-day work in phonology and morphology, provided an impoverished
phonological representation combined with a relatively unconstrained
theory of rules. Although work in computational phonology and
morphology has in general not advanced beyond this primitive stage,
there have been many developments in morphological and phonological
theory, such as:
- the lexical/postlexical division
- underspecification
- templatic morphology
- tighter constraints on rule form
- the discovery of the role of prosodic constituency
We will review some of the more important of these developments.
____________
SYMBOLIC SYSTEMS FORUM
Overview of Research at the Center for the
Study of Language and Information
Stanley Peters
Director of CSLI
(peters@csli.stanford.edu)
Thursday, 19 April, 4:15 p.m.
Cordura 100
NOTE TIME AND PLACE CHANGE FOR THIS WEEK ONLY
The Center for the Study of Language and Information (CSLI) is an
institute that focuses on basic research on language and information.
Its members are Stanford faculty and graduate students from the
departments of computer science, linguistics, philosophy, and
psychology, as well as researchers from bay area industrial research
centers, including SRI International, Xerox PARC, and Hewlett Packard,
and visiting scholars from the United States and around the world.
There is significant overlap in the content area that CSLI covers in
its research and that which SSP covers in its educational program. In
addition, a large proportion of SSP's faculty are affiliated with
CSLI. Stanley Peters will give an outline of some of CSLI's current
research projects.
Before the talk begins at 4:15 p.m., there will be an informal
get-together (with refreshments), outside the SSP office in Cordura
Hall, in the first lounge (111).
Next week: Applications of Nonwellfounded Sets in Symbolic Systems,
Jon Barwise.
____________
HISTORICAL LINGUISTICS GROUP
The Development of Verbal Focus in Philippine Languages
Paul Kroeger
Department of Linguistics
Stanford University
(kroeger@csli.stanford.edu)
Thursday, 19 April, 7:30 p.m.
Ventura 17
The voice-marking system of Philippine-type languages has been the
subject of considerable controversy, both descriptive and theoretical.
In this talk, I will address the question of how such a unique system
could arise historically in a typologically plausible way. The
hypothesis I will propose involves the reanalysis of different classes
of morphemes, specifically nominalizers and case-markers, as a single
paradigm of verbal affixes that reflect the thematic role of the
"subject." The hypothesis crucially assumes, following Shibatani and
others, that the subject in Philippine languages is a grammaticalized
Topic, derived from a pattern of topicalization still attested in a
number of Oceanic languages.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
A System of French Verse
Jean Claude Milner
University of Paris
Friday, 20 April, 3:30 p.m.
Cordura 100
No abstract available.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
Agent-Oriented Programming
Yoav Shoham
Department of Computer Science
Stanford University
(shoham@score.stanford.edu)
Monday, 23 April, 2:30 p.m.
Margaret Jacks Hall 252
I will discuss our work on a computational framework called
Agent-Oriented Programming.
As a programming paradigm, AOP can be viewed as an extension of
Object-Oriented Programming. It extends OOP by having modules not
only communicate with one another, but also possess knowledge and
beliefs, choices and abilities, and possibly other notions.
As a logical theory, it extends standard epistemic logics. Beside
temporalizing the K (knowledge) and B (belief) operators, it
introduces operators for choice (C) and ability (A).
In either case, the intuition about these mentalistic-sounding notions
is guided by intuition about the commonsense, everyday concepts,
though the actual formal definitions come nowhere close to capturing
the full linguistic meanings.
____________
PHONOLOGY WORKSHOP
Consonant Harmony in Children's Early Productions
Cathy Echols
Department of Psychology
Stanford University
(echols@psych.stanford.edu)
Tuesday, 24 April, 7:30 p.m.
Ventura 17
No abstract available.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
AIDS Prevention
Tom Coates
University of California, San Francisco
Wednesday, 25 April, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
NEW CSLI VISITOR
Syoichi Muto
IAP Visiting Researcher
Computer and Communication Research Center
Tokyo Electric Power Company (TEPCO), Japan
Dates of visit: March 1990-March 1991
Since 1983, Syoichi has been working on research and development of
intelligent systems for power systems. He supported research on a
support system for substation operators, a short-term powerload
forecasting system, and a learning system for power-system stability.
His current interests include knowledge representations and inference
procedures for a diagnosis system for power systems. His research is
related to temporal reasoning, modal logic, and causal reasoning.
____________
∂19-Apr-90 0820 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU New Journal on Computational Geometry & Applications
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Apr 90 08:20:35 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04884; Thu, 19 Apr 90 08:20:46 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07287; Thu, 19 Apr 90 08:20:08 -0700
Message-Id: <9004191520.AA07287@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8311; Thu, 19 Apr 90 10:17:52 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8270; Thu, 19 Apr 90 10:17:48 CDT
Date: Thu, 19 Apr 90 10:16:41 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Der-Tsai Lee <dlee@note.nsf.gov>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Der-Tsai Lee <dlee%note.nsf.gov@VM1.NoDak.EDU>
Subject: New Journal on Computational Geometry & Applications
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
ANNOUNCEMENT OF A NEW JOURNAL
ON
COMPUTATIONAL GEOMETRY AND APPLICATIONS
CALL FOR PAPERS
**********************************************************************
The International Journal of Computational Geometry & Applications is a
quarterly journal of computer science devoted to the field of computational
geometry within the framework of design and analysis of algorithms, and its
applications to various fields including computer-aided geometry design
(CAGD), computer graphics, constructive solid geometry (CSG), operations
research, pattern recognition, robotics, solid modelling, VLSI routing/layout,
and others.
The main emphasis is placed on the computational aspects of geometric
problems that arise in various fields of science and engineering. Research
contributions ranging from theoretical results in algorithm design,
sequential or parallel, probabilistic or randomized, to applications in the
above-mentioned areas are welcome. Research findings or experiences in the
implementations of geometric algorithms, such as numerical stability,
and papers with a geometric flavor are also welcome.
EDITORIAL BOARD
Alok Aggarwal, Tetuso Asano, Mikhail Atallah, Jean-Daniel Boissonnat,
Bernard Chazelle, David P. Dobkin, Ronald L. Graham, Leo J. Guibas,
Christoph M. Hoffmann, John E. Hopcroft, Masoa Iri, David G. Kirkpatrick,
D. T. Lee, Joseph O'Rourke, Franco P. Preparata, R. C. T. Lee,
Godfried T. Toussaint, Ralph Wachter, Tony C. Woo, Frances Yao
Target Date for the 1st Issue: Jan-March 1990.
INFORMATION FOR AUTHORS
Submit 5 copies of each manuscript to the Managing Editor or to any Editor
on the Editorial Board. A fee of $200.00 for each paper will be billed to the
author(s)/institution(s) upon acceptance of the manuscript to cover the cost
of paper handling. The fee may be exempted under some unusual circumstances.
This journal is aimed to minimize paper processing time and to expedite
printing, therefore electronic submission of papers in final form is strongly
encouraged.
For more details please contact the Managing Editor or the Publisher.
Prof D. T. Lee
Managing Editor (IJCGA)
Division of Computer and
Computation Research
National Science Foundation
1800 G St. NW
Washington DC 20550
USA
dtlee@eecs.nwu.edu
Publisher : World Scientific Publishing Co.
687 Hartwell Street, Teaneck, NJ 07666
(Singapore x New Jersey x London x Hong Kong)
∂19-Apr-90 1154 @Theory.Stanford.EDU:sherry@Neon.Stanford.EDU Discrete Math Conference
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 Apr 90 11:54:31 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA06378; Thu, 19 Apr 90 11:43:28 -0700
Received: from LOCALHOST by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18610; Thu, 19 Apr 90 11:49:36 -0700
Message-Id: <9004191849.AA18610@Neon.Stanford.EDU>
To: aflb-su@Theory.Stanford.EDU
Subject: Discrete Math Conference
Date: Thu, 19 Apr 90 11:49:35 -0700
From: sherry@Neon.Stanford.EDU
I am looking for someone to share a room with at the Discrete
Mathematics conference in Atlanta, June 11-14. The "conference
themes" are combinatorics and graph theory, operations research,
algorithms and complexity, and parallel and distributed computing.
The invited presentations include talks by Noga Alon, John Conway,
Narendra Karmarkar, Richard Karp, Eva Tardos, and Leslie Valiant.
If you are interested in attending, if you are interested in looking
at the preliminary program, or if you know someone else who is looking
for a roommate, please let me know. Thanks.
-- Sherry.
∂20-Apr-90 0926 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Eric Roberts
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Apr 90 09:26:15 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03032; Fri, 20 Apr 90 09:26:12 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA12927; Fri, 20 Apr 90 09:25:24 PDT
Date: Fri, 20 Apr 90 09:25:24 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004201625.AA12927@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Eric Roberts
I am pleased to be able to report the following
progress on the matter of appointing Eric Roberts
to the position of Associate Professor (Teaching):
1) The SOE excom has given final and unanimous
approval to Eric's appointment. I expect the other
formal approvals up the line will be routine.
2) Eric has given us oral indication that he will
be accepting our offer---pending agreements on
salary, etc.
3) Eric will be attending the CS faculty retreat,
and I will invite him to give us a short presentation
there about his views on CS education, etc.
-Nils
∂20-Apr-90 0928 chandler@Sunburn.Stanford.EDU Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Apr 90 09:28:32 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA03125; Fri, 20 Apr 90 09:28:45 -0700
Date: Fri, 20 Apr 1990 9:28:45 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com,
stefik@cs.Stanford.EDU
Subject: Faculty Lunch
Message-Id: <CMM.0.88.640628925.chandler@Sunburn.Stanford.EDU>
This is to remind you of next Tuesday's faculty lunch....Charles Kruger and
Ken Down will be coming by to talk to us about the impact of repositioning on
the SOE and CSD. See you there! (4/24-12:15-MJH-146)
∂20-Apr-90 0958 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU draft agenda
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Apr 90 09:57:59 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04041; Fri, 20 Apr 90 09:58:33 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA12957; Fri, 20 Apr 90 09:57:42 PDT
Date: Fri, 20 Apr 90 09:57:42 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004201657.AA12957@Tenaya.Stanford.EDU>
To: retreatattendees1990@cs.stanford.edu
Subject: draft agenda
Cc: golub@cs.stanford.edu, kruger@sierra.stanford.edu,
gibbons@sierra.stanford.edu
Here is a draft agenda for our upcoming CS retreat
scheduled for May 4, 5, and 6. Please let me know
asap if you see any problems with the schedule---especially
if you see your talk listed at a bad time for you (or with
an inappropriate title). If your talk title is still entitled "xxx," please
let me know asap what title you would like listed for
your talk. Thanks, -Nils
------
DRAFT
Computer Science Department
1990 Faculty Retreat
Chaminade at Santa Cruz
1 Chaminade Lane
Santa Cruz, CA
Phone at Chaminade: 408-475-5600
["xxx" means "to be announced"]
(All meetings in the xxx Room)
Friday, May 4
Dinner 6:00-8:00
Evening Session: 8:00-9:30
Panel Discussion: "What's Right, What's Wrong
with the CSD? A Potpouri of Views"
Vivian Luo, CS Undergraduate
Don Geddis, PhD Student
Harvinder Singh, MS Student
Roy Jones, Lecturer
John Mitchell, Junior Faculty
xxx (an old-timer---any volunteers?)
Saturday, May 5
Breakfast 7:00-9:00 (Buffet in Main
Dining Room)
Morning Session A: 8:45-10:15
Vladimir Lifschitz, "Representing Action and
Change in Artificial Intelligence," and "Recent
Results on the Frame Problem"
Ed Feigenbaum, "xxx"
Break
Morning Session B: 10:45-12:00
John McCarthy, "Elephant"
Yoav Shoham, "Agent-Oriented
Programming"
Lunch (in Main Dining Room)
Afternoon Session A: 1:30-3:00
xxx, "xxx"
Rajeev Motwani, "xxx"
Vaughan Pratt, "xxx"
Break
Afternoon Session B: 3:30-4:30
Tom Binford, "xxx"
Monica Lam, "A Language for Coarse-Grain
Parallelism"
Free (Discussion and Volleyball)
Dinner 6:00-8:00 (Buffet in Main
Dining Room)
(NOTE: Reservations must be made ahead of time
by individuals for dinner!!)
Evening Discussion 8:00--?
"The CSD Budget," Vaughan Pratt and
George Wheaton
"Proposal for an Intelligent Building"
Sunday, May 6
Continental Breakfast 7:00-9:00 (in xxx)
Morning Session A: 9:00-10:00
Eric Roberts on Computer Science
Education
Terry Winograd, "What Can We Teach About
Human-Computer Interaction?"
Break
Morning Session B: 10:30-11:45
John Koza, "Genetically Breeding
Populations of Computer Programs to
Solve Problems"
Dan Weise, "Overview of the FUSE
Project: Automatic Program
Transformation Using Partial Evaluation"
Brunch 12:00-1:00 (in Main Dining
Room)
Adjourn 1:00
∂20-Apr-90 1115 chandler@Sunburn.Stanford.EDU Second Senate Meeting on the Professoriate Information
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Apr 90 11:15:06 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA06801; Fri, 20 Apr 90 11:14:57 -0700
Date: Fri, 20 Apr 1990 11:14:56 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Second Senate Meeting on the Professoriate Information
Message-Id: <CMM.0.88.640635296.chandler@Sunburn.Stanford.EDU>
I have the following information in my office. If you are interested in let
me know...I will be happy to send you a copy.
1. Recommendations from the Second Senate AD HOC Committee on the
Professoriate at SU to the Twenty-Second Senate of the Academic Council.
2. Summary of Comments made at open meetings with various groups within the
SU community.
3. Report of the C-PS2 (Second Senate Committee on the Professoriate at
Stanford).
∂20-Apr-90 1228 LOGMTC-mailer Seminar abstract
Received: from gauss.stanford.edu by SAIL.Stanford.EDU with TCP; 20 Apr 90 12:27:59 PDT
Received: by gauss.stanford.edu (3.2/4.7); Fri, 20 Apr 90 12:28:24 PDT
Date: Fri, 20 Apr 90 12:28:24 PDT
From: matija@gauss.stanford.edu (Yuri Matijasevich)
To: logmtc@sail
Subject: Seminar abstract
Seminar in Logic and Foundations
Yuri MATIJASEVICH
Steklov Institute of Mathematics (Leningrad)
ELIMINATION OF BOUNDED UNIVERSAL QUANTIFIERS
FROM THE ARITHMETICAL REPRESENTATIONS
OF RECURSIVELY ENUMERABLE SETS
(Davis-Putnam-Robinson theorem, thirty years later)
Wed.,Apr.25, 4:15
A recursively enumerable set of natural numbers can be defined as
a set M having a representation of the form
a in M iff Q x Q x ...Q x P(x ,x ,...,x )=0
1 1 2 2 m m 1 2 m
where P is a polynomial with integer coeficients and the Q's are either
existential or bounded universal quantifiers. Forty years ago
Martin Davis conjectured that in fact all the quantifiers could be
existential (and this would immediately imply algorithmic
unsolvability of Hilbert's tenth problem about Diophantine equations).
At that time he showed that it suffices to have a single bounded
universal quantifier in an arithmetical representation of any r.e. set.
A crucial step in the negative solution of Hilbert's tenth problem
was achieved in 1960 by Martin Davis, Hilary Putnam and Julia Robinson.
They eliminated the remaining bounded universal quantifier at the cost
of using an exponential Diophantine equation instead of a genuine
Diophantine one. Today, three essentially different techniques are
known for proving this result. Two of them can be founf in the literature;
in the talk they will be outlined including numerous variations. More
attention will be given to a new technique recently found by the speaker.
∂20-Apr-90 1615 LOGMTC-mailer Seminar in Logic and Foundations
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 Apr 90 16:15:49 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA23492; Fri, 20 Apr 90 16:18:02 PDT
Date: Fri, 20 Apr 1990 16:18:01 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.640653481.sf@csli.stanford.edu>
The second seminar by Yuri Matijasevich (see the msg with his title and
abstract) will take place Wed. May 2, 4:15 in Room 383N (3d floor Math
Lounge). Note correction to the date, which is a week later.
∂21-Apr-90 1556 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU renewal of courtesy and consulting faculty
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Apr 90 15:56:39 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27174; Sat, 21 Apr 90 15:57:22 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA13733; Sat, 21 Apr 90 15:56:29 PDT
Date: Sat, 21 Apr 90 15:56:29 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004212256.AA13733@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: renewal of courtesy and consulting faculty
Most of our consulting and courtesy faculty appointments expire on
8/31/90. I am in favor of renewing those who would otherwise expire,
and I would also like to recommend that we appoint Martha Pollack of
SRI (an expert in natural language research, a frequent member of CSD
committees, and a member of some our PhD reading committees) as a
consulting associate professor. Usually we discuss these matters and
then vote at a faculty meeting. Please reserve our usual faculty
meeting time on Tuesday May 1 (2:30 p.m.---Joyce will announce the
room) for this purpose. Our consulting faculty file activity reports
every year so we can keep up with their activities in support of the
CSD. Joyce will have all of these on file prior to the faculty
meeting for you to stop by and inspect. Here is the list as compiled
by Edie Gilbert:
CSD Consulting and Courtesy Professors
coming up for Reappointment in 1990
CONSULTING
Forest Baskett Professor Silicon Graphics
Robert Cypher Asst Professor IBM Almaden
Bruce DeLagi Professor KSL & EE, Stanford
Richard Gabriel Assoc Professor Lucid, Inc
Robert Hagmann Assoc Professor Xerox PARC
Joseph Halpern Assoc Professor IBM Almaden
Patrick Hayes Professor Xerox PARC
Jussi Ketonen Professor Hewlett-Packard
*Douglas Lenat Professor Microelectronics
Susan Owicki Assoc Professor DEC
Victor Pereyra Professor Weidlinger Assoc
Brian Reid Assoc Professor DEC
Jay M. Tenenbaum Professor Schlumberger/CIS
*Moshe Vardi Assoc Professor IBM Almaden
Stanley Rosenschein Professor TELEOS Research
Richard Waldinger Professor SRI
*Lenat and Vardi appointments expire on 12/31/90. All others expire
on 8/31/90.
COURTESY
Giovanni DeMicheli Assoc Professor EE, CIS
Michale Flynn Professor EE, ERL
John T. Gill Assoc Professor EE, Durand
Mark Horowitz Asst Professor EE, CIS
Mark Linton Asst Professor EE, CIS
Teresa Meng Asst Professor EE, CIS
Mark Musen Asst Professor Medicine, MSOB
David Rumelhart Professor Psychology, 420
Edward Shortliffe Assoc Professor Medicine, MSOB
Fouad Tobagi Professor EE, ERL
David Ungar Asst Professor EE, CIS
Daniel Weise Asst Professor EE, CIS
The above Courtesy Appointments expire on 8/31/90.
(Bernard Mont-Reynaud, Assoc Prof by Courtesy from the Music Dept, is
not up for renewal until 8/31/91).
∂21-Apr-90 1831 grundy@csli.Stanford.EDU Symbolic Systems Forum
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 Apr 90 18:31:11 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA24638; Sat, 21 Apr 90 18:22:36 PDT
Date: Sat 21 Apr 90 18:22:35-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum
To: grundy@csli.Stanford.EDU
Message-Id: <640750955.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, April 26, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Jon Barwise
Topic: "Applications of Non-wellfounded Sets
in Symbolic Systems"
ABSTRACT
--------
Non-wellfounded sets have been in ill repute for
seventy-odd years. The reason is that they were mistakenly
implicated in the paradoxes of set theory. In recent years,
though, they have been rehabilitated. This rehabilitation
has been brought about in part by theoretical work in set
theory, where Aczel and others have shown how to make sense
of such sets, and in part because of the applications that
are being found for them in the symbolic sciences. In this
elementary talk I will motivate them by means of example,
and discuss the theory of non-wellfounded sets a bit.
Refreshments will be served.
Following week, May 3
Ben Libet, Physiology, UC San Francisco
"The Neurophysiology of Conscious Experience"
CHANGE IN CALENDAR:
The announced dates of the talks by Professors Girard
and Dupuy in May have been switched. Prof. Dupuy will be
speaking on May 17 "On the Self-deconstruction of the
Symbolic Order," and Prof. Girard will give his talk on "The
Genesis of Symbolic Forms in Human Culture" on May 24.
If you wish to be added to the Symbolic Systems Forum
mailing list, send a note to Bill Grundy (grundy@csli).
-------
∂22-Apr-90 0825 @Sunburn.Stanford.EDU:gio@sumex-aim.stanford.edu Re: renewal of courtesy and consulting faculty
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 Apr 90 08:25:19 PDT
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01156; Sun, 22 Apr 90 08:26:04 -0700
Received: by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA10941; Sun, 22 Apr 90 08:28:13 PDT
Date: Sun, 22 Apr 1990 8:28:13 PDT
From: Gio Wiederhold <gio@sumex-aim.Stanford.EDU>
To: Nils Nilsson <nilsson@tenaya.stanford.edu>
Cc: ac@cs.stanford.edu
Subject: Re: renewal of courtesy and consulting faculty
In-Reply-To: Your message of Sat, 21 Apr 90 15:56:29 PDT
Message-Id: <CMM.0.88.640798093.gio@sumex-aim.stanford.edu>
I would also like to recommend two more consulting professor ships.
These people are now nominally visiting professors, but participate actively
and regularily in our teaching program, and are receiving no visible
recognition.
They are
Stefano Ceri --- Professor in CS at the University of Modena., researcher
also in Elect. Ing. at the Politechnica in Milano.
Stefano has now been teaching a regular CS cours, CS347, every summer
for six years. The course is part of our program, Stefano is listed as
the responsible faculty member, and the course is an important part
of our SITN programs. I have a vitae in my office.
Witold Litwin --- Professor at the Dauphine University in Paris, research
manager at INRIA in France, and researcher at Hewlett-
Packard Laboratories.
Witold has taught the successful new Federated database course in the
Industrial Lectureship series, and is proposing to present this course
again. He is also advising students. I have his vitae as well. He is
at this moment at hewlett-Packard, during the (generous) European
Easter break.
Gio
∂23-Apr-90 0812 chandler@Sunburn.Stanford.EDU CSD-s 25th Anniversary
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 08:11:57 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA25945; Mon, 23 Apr 90 08:12:42 -0700
Date: Mon, 23 Apr 1990 8:12:42 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: CSD-s 25th Anniversary
Message-Id: <CMM.0.88.640883562.chandler@Sunburn.Stanford.EDU>
Organizational Meeting for CSD's 25th Anniversary
Faculty Club, April 20, 1990
In attendance were: Ed Feigenbaum, John Levy, Nils NIlsson,
Carolyn Tajnai, George Wheaton, Voy Wiederhold
_____________________________________________________________________
After some discussion, the dates chosen for the occasion were
Friday to Sunday, Nov. 9-11, 1990. Nils will check these
dates out to be sure they do not conflict with the Stanford
Centennial celebration activities. He volunteered Joyce Chandler
to check on room availability. The facilities required would be
the Faculty Club on Friday and Saturday evenings and Fairchild
Auditorium on Saturday during the day. Sunday's activities can be
a bit flexible.
The theme selected was proposed at the last meeting by Ed
Feigenbaum, "Yesterday, Today, and Tomorrow".
The overall chairman was chosen to be Tom Bredt. John Levy
agreed to assist with mailing lists and information from the last
event similar to this in which he was heavily involved. Of course,
these lists would have to be updated.
Carolyn Tajnai and George Wheaton agreed to coordinate the
overall office and financial work that is needed. Carolyn had
someone in mind who might be able to help with the financial work.
In addition, they would get the announcments out, the invitations,
collect the reponses, etc. Ed Feigenbaum suggested that if we could
get some financial help (say from Jerry Leiberman's Centennial fund),
we could hire Georgia Sutherland to help Carolyn and George.
Nils already checked on this, but will try some more.
The first announcement will appear in "Nil's Newsletter" due out
soon. Nils will write the announcement. Later a followup, more
detailed information sheet and registration form, will be sent out.
It is expected that 200-300 people may attend.
The following program was agreed upon:
Friday evening, Nov. 9: A no-host reception at the Faculty Club.
Carolyn Tajnai and George Wheaton will organize this event.
Saturday all day, Nov. 10: Symposium at Fairchild auditorium.
Tom Bredt, Ed Feigenbaum, and Gio Wiederhold will organize
the invited speakers and program for this event.
Saturday evening, Nov. 10: Banquet at the Faculty Club
John Schoch will organize the program for the after dinner
talk and entertainment. It is hoped that the atmosphere
will be light and festive as well.
(Suggested names were Steve Jobs, John Scully, Norm Pollack)
Sunday Nov. 11: There will be a brunch for everyone to get together
once more, followed by various "special interest" events, ie.
possibly an open-house by some faculty members or some
small discussion groups in MJH. For example,
(KSl reunion with Ed Feigenbaum, KBMS reunion with Gio
Wiederhold, etc.)
Voy Wiederhold will organize the brunch and the various
"special interest" groups.
Rather than make this a fund-raising event, it was decided to
charge an at-cost fee. This was estimated to be about $110+.
Students would get a discount if they helped out, i.e. with
registration, cleaning, etc. It was suggested by Ed Feigenbaum
that perhaps students who want to attend may be subsidized by
their faculty advisors (with their unrestricted funds).
The student representatives (Don Gettis, Vivian Lo, Becky Thomas,
Tony Choy) will be asked to give their input and help coordinate.
One other item would be nice, and that is, a newsletter
giving the whereabouts and what people are doing now. This would
include former faculty and students. It was decided this would be
an ambitious project unless we could get some help, say from
Georgia Sutherland) to collect this, and have it printed.
Nils reported he will not be chairman in November. The new
chairman will be announced soon. Voy stated it would be very nice
if both Nils and the new chairman would be at the celebration.
There will be another meeting in May. Joyce Chandler will
send out the announcement of the date. One thing not resolved was
the invitations list; in particular, which companies to invite.
∂23-Apr-90 0846 chandler@Sunburn.Stanford.EDU May 1 Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 08:46:08 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27269; Mon, 23 Apr 90 08:46:52 -0700
Date: Mon, 23 Apr 1990 8:46:51 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: May 1 Faculty Meeting
Message-Id: <CMM.0.88.640885611.chandler@Sunburn.Stanford.EDU>
Just to let you know that the May 1 faculty meeting is scheduled to be held
at 2:30 in MJH-146.
∂23-Apr-90 0925 @Sunburn.Stanford.EDU:tcr@sumex-aim.stanford.edu Possible Affirmative Action Opportunity
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 09:25:37 PDT
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA29059; Mon, 23 Apr 90 09:25:40 -0700
Received: from (KSL-Mac-55.Stanford.EDU) by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA01346; Mon, 23 Apr 90 09:27:33 PDT
Date: Mon, 23 Apr 1990 09:25:13 PST
From: TC Rindfleisch <tcr@sumex-aim.Stanford.EDU>
Subject: Possible Affirmative Action Opportunity
To: KSL-Project-Leaders@sumex-aim.stanford.edu, Faculty@cs.stanford.edu
Cc: tcr@sumex-aim.stanford.edu
Message-Id: <MacMS.31353.5627.tcr@sumex-aim.stanford.edu>
FYI -- anyone have a research opening now or coming up? Tom R.
----------------
To: tcr%cs.stanford.edu@relay.cs.net
Subject: Inquiry
Date: Mon, 23 Apr 90 2:16:11 EDT
From: puerta%midway.ece.scarolina.edu@relay.cs.net
Sender: puerta%midway.ece.scarolina.edu@relay.cs.net
Dear Mr. Rindfleisch
My name is Angel R. Puerta, a doctoral candidate at the
Center for Machine Intelligence of the University of South
Carolina. Dr. Terry Winograd suggested to me that I should
contact you to inquire about possible research opportunities
at the Knowledge Systems Laboratory.
I am graduating next month and my dissertation research
dealt with the problem of Machine Learning for user
interfaces and included a blackboard-based prototype of a
self-adaptive interface. It is my desire now to find a
research position in the AI/HCI fields especially in one of
these subareas:
Intelligent Interfaces
Blackboard Architectures
Machine Learning
Knowledge-based systems (a little too general perhaps but
including intelligent
tutoring systems and expert systems)
My expertise is mainly on symbolic knowledge manipulation.
Would you be so kind as to indicate to me the procedure that
I should follow to investigate research opportunities
(temporary, postdoc, or permanent)?. Or maybe you could
refer me to someone else who could help me with this?.
I hope this will not detract from your busy schedule and I
sincerely thank you for your help.
Angel R. Puerta
*************************************
* Center for Machine Intelligence *
* University of South Carolina *
* 23 Shuler Circle *
* Columbia, SC, 29212 *
*************************************
net: puerta@ece.scarolina.edu
puerta@sauron.columbia.ncr.com
-------
∂23-Apr-90 1103 LOGMTC-mailer Raymond Smullyan lecture
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 11:03:31 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA20411; Mon, 23 Apr 90 11:05:44 PDT
Date: Mon, 23 Apr 1990 11:05:40 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Raymond Smullyan lecture
Message-Id: <CMM.0.88.640893940.sf@csli.stanford.edu>
Karel de Leeuw Memorial Lecture
Prof. Raymond Smullyan, Dept of Philosophy, Indiana University
"Satan, Cantor, and Infinity"
Monday, April 30, 1990, 4:15 PM
Room 420-040 (Jordan Hall), Stanford University
This lecture is intended for a general audience.
∂23-Apr-90 1109 LOGMTC-mailer Matijasevich lectures
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 11:09:01 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA20594; Mon, 23 Apr 90 11:11:14 PDT
Date: Mon, 23 Apr 1990 11:11:11 PDT
From: Sol Feferman <sf@csli.stanford.edu>
To: logmtc@sail.stanford.edu
Subject: Matijasevich lectures
Message-Id: <CMM.0.88.640894271.sf@csli.stanford.edu>
Reminder: yuri Matijasevich is giving two lectures in the Seminar on Logic
and Foundations. The first is this afternoon, 4:15-5:30, Room 381-T, on
"Real numbers and real computers". A dinner out with the speaker at the
MacArthur Park restaurant in Palo Alto is planned following the talk.
Please let me know if you are interested in joining us.
The second lecture is scheduled for Wednesday May 2, 4:15-5:30 in Room 383N.
The subject is exponential diophantine representability of r.e. sets, with
a survey of previous methods and a new proof. Please note the one time
change in time and place of the seminar due to the conflict with the
Smullyan lecture on Monday April 30.
∂23-Apr-90 1541 aileen@Sunburn.Stanford.EDU louis lerman
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 15:41:22 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19021; Mon, 23 Apr 90 15:42:15 -0700
Date: Mon, 23 Apr 1990 15:42:12 PDT
From: Aileen Schaefer <aileen@Sunburn.Stanford.EDU>
To: jmc-lists@sail.Stanford.EDU
Subject: louis lerman
Message-Id: <CMM.0.88.640910532.aileen@Sunburn.Stanford.EDU>
just got back in town and will call again this week before
leaving for the east coast.
∂23-Apr-90 2307 axwang@Theory.Stanford.EDU AFLB on Thursday
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 Apr 90 23:07:15 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA12746; Mon, 23 Apr 90 22:53:34 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA09749; Mon, 23 Apr 90 22:58:30 -0700
Message-Id: <9004240558.AA09749@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: AFLB on Thursday
Date: Mon, 23 Apr 90 22:58:26 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
This Thursday's AFLB features Kireeti Kompella from USC. AFLB meets
as usual on Thursday at 12:00pm in MJH 252.
Program Checkers for Modular Exponentiation
Kireeti Kompella
USC
Program checkers are an algorithmic approach to the program correctness issue.
Introduced by Manuel Blum, they provide in many cases a practical solution to
the problem, "Has this program produced a correct output at the given input
value?" Checkers also pose important theoretical questions, among them,
whether it is always easier to check than to compute, and determining the
structure of problems that admit fast checkers.
This talk presents program checkers for modular exponentiation: given
integers a, b, c, compute a↑b mod c. We show that, whereas current
techniques for exponentiating require O(log b) multiplications, a processor
restricted to performing only O(loglog b) multiplications can check
exponentiation using O(loglog b) queries of the program. Independently,
Ronitt Rubinfeld has obtained a checker that requires O((loglog b)↑4)
multiplications and O((loglog b)↑3) queries. We also demonstrate a hypothesis
under which checking can be done with a constant number of multiplications
and queries. Such a checker would imply that any program for modular
exponentiation can be transformed to a "self-checking" program with
asymptotically no loss in efficiency.
This work was done jointly with Leonard Adleman.
∂24-Apr-90 0133 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM derivatives of a quotient
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 24 Apr 90 01:33:47 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 505511; 24 Apr 90 04:05:50 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 122429; Tue 24-Apr-90 01:04:05 PDT
Date: Tue, 24 Apr 90 01:04 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: derivatives of a quotient
To: math-fun@RUSSIAN.SPA.Symbolics.COM, macsyma-i@RUSSIAN.SPA.Symbolics.COM
cc: "rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "hul@psuvm.psu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"beeler@bbn.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "hpm@rover.ri.cmu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900423114154.8.RWG@TSUNAMI.SPA.Symbolics.COM>
Message-ID: <19900424080412.1.RWG@TSUNAMI.SPA.Symbolics.COM>
Date: Mon, 23 Apr 90 04:41 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Suppose I have a truly neat way to compute n(x) and d(x) and
their first several derivatives n', d', n'', d'', ... , but
what I really want are the derivatives of the quotient n/d,
(n/d)' = n'/d - n d'/d↑2,
(n/d)'' = n''/d - (2 n' d' + n d'')/d↑2 + 2 n (d')↑2/d↑3,
(n/d)''' = ...
The general formula is normally given by specializing Faa di Bruno's
(not in A&S??) for f(g(x)), with f(y) := n(x)/y and g(x) := d(x).
But this is a hairy iterated sum over partitions.
Solution: Form generating functions for the derivatives via
Taylor's thm, and use the quotient of power series recurrence in
A&S 3.6.22:
k
k ==== j k-j
d \ k d d N(x)
--- N(x) - > ( ) (--- D(x)) (----- ----)
k / j j k-j D(x)
k dx ==== dx dx
d N(x) j = 1
--- ---- = -------------------------------------------- .
k D(x) D(x)
dx
k k
d d N(x)
I.e., just expand --- N(x) = --- (D(x) ----) (a la Leibniz)
k k D(x)
dx dx
k
d N(x)
and solve for --- ---- .
k D(x)
dx
The truly neat source of N, D, N', D', etc: I have a rapidly
convergent series for Psi[0](x)-Psi[0](y) (the digamma fcn),
which I evaluate by multiplying matrices into a vector:
V = V M M M ... M ,
0 m m m-1 m-2 0
where V is initialized to [1,1], and M contains rational
m n
functions of n and x and y. This leaves [<sum>, 1] in V .
0
The recurrence is just V = V M . (Multiplying the matrices
n-1 n n
in the other order works, but is like evaluating a polynomial
literally, rather than by Horner's rule. Worse, it will vitiate
the upcoming derivative stunt.)
Suppose now that you want trigammas and higher, which are derivatives
of digamma. You can simply differentiate the recurrence to get
V' = V M' + V' M ,
n-1 n n n n
which can be computed in parallel with V . Similarly for the
n
higher derivatives, which rely on corresponding derivatives of M.
However, it is possible to clear the denominators from the rational
functions in M, leaving only polynomials. And these polynomials are
of low degree in x and y, so as to have all their higher derivatives
vanish identically! Thus the recurrences for the higher derivatives
if V remain very simple. But, instead of getting V = [n/d,1],
0
V' = [n/d,1]', V'' = [n/d,1]'', etc., we now get
0 0
[n,d], [n,d]', [n,d]'', ... . Hence this message.
∂24-Apr-90 0856 aileen@Sunburn.Stanford.EDU express mail
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Apr 90 08:56:06 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA01937; Tue, 24 Apr 90 08:57:02 -0700
Date: Tue, 24 Apr 1990 8:57:01 PDT
From: Aileen Schaefer <aileen@Sunburn.Stanford.EDU>
To: jmc-lists@sail.Stanford.EDU
Subject: express mail
Message-Id: <CMM.0.88.640972621.aileen@Sunburn.Stanford.EDU>
you have an express mail package at the reception desk (211)
∂24-Apr-90 0949 reis@cis.Stanford.EDU SURF student available
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Apr 90 09:49:31 PDT
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Tue, 24 Apr 90 09:46:47 PDT
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA06607; Tue, 24 Apr 90 09:45:54 PDT
Date: Tue 24 Apr 90 08:45:53-PST
From: Rick Reis <REIS@cis.stanford.edu>
Subject: SURF student available
To: cis-faculty@glacier.stanford.edu, ee-faculty@sierra.stanford.edu
Cc: reis@cis.stanford.edu
Message-Id: <VAX-MM(187)+TOPSLIB(118) 24-Apr-90 08:45:53.CIS.STANFORD.EDU>
Folks:
I have a junior EE students , Victor Lam (4.07 GPA) who is looking for
a summer SURF position with an EE professor. Under this program the School
of Engineering pays 2/3 or the cost and the faculty member 1/3. Total
cost to the faculty member for three months full-time work is $1,500
salary plus benefits for a total slighlty under $2,000. Under such
circumstances it is a real bargin.
Victor is primarly intersted in computer systems, semiconductor devices,
circuit design, etc. He leans more toward hardware than software but is
very flexable. He mainly wants an experience that introduces him to
what research is like and would be happy to work with a professor
and/or one of his graduate students.
IBM is breathing down Victor's neck and he needs to let them know quickly
if he is going to accept their offer. He prefers to work for SURF.
If any of you have an interest in talking further with Victor would you let
me know by e-mail by the end of the day if possible. Sorry of the short
notice.
Rick
P.S. I may have a few more SURF students who have not found advisors so if you
are interested in having me tell you more about them if they come up just
let me know.
Thanks
-------
∂24-Apr-90 1018 weening@Gang-of-Four.Stanford.EDU Workshop on Parallel Lisp/Prolog
Received: from Gang-of-Four.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Apr 90 10:18:07 PDT
Received: by Gang-of-Four.Stanford.EDU (5.61/inc-1.0)
id AA03260; Tue, 24 Apr 90 10:18:33 -0700
Date: Tue, 24 Apr 90 10:18:33 -0700
Message-Id: <9004241718.AA03260@Gang-of-Four.Stanford.EDU>
From: kessler%cons@cs.utah.edu (Robert R. Kessler)
Sender: weening@Gang-of-Four.Stanford.EDU
To: parallel-lisp@Gang-of-Four.Stanford.EDU
Subject: Workshop on Parallel Lisp/Prolog
CALL FOR PARTICIPATION
----------------------
WORKSHOP
ON
PARALLEL IMPLEMENTATION OF LANGUAGES
FOR SYMBOLIC COMPUTATIONS
July 30-31, Eugene
University of Oregon
Parallel Implementations of languages like LISP, Prolog, STRAND, Linda,
and several other are approaching certain maturity. A few systems can
already be considered of production quality, and some are even
commercially available. A lot of excellent results have been obtained in
more or less disjoint communities. The problems attacked and the solutions
obtained by different groups have very much in common, and yet a lot of
effort is duplicated. We intend to bring together researchers from
different ends of the field, in order to share and discuss our results.
Presentations and discussions are invited on the following topics:
- Explicit versus implicit parallelism
- Programming for efficiency
- Data dependency analysis
- Automatic parallelisation
- Grain analysis
- Speculative computations
- Scheduling and load balancing
- Shared- versus distributed-memory implementations
- Memory management
- Performance measurements
- Benchmarks
- "Real" applications
Suggestions for other topics are welcome.
Program Outline
---------------
We plan to start with two or more tutorials to create a common ground for
all participants. That will be followed by presentations, discussions and,
possibly demonstrations (we have access to a Sequent/Symmetry and a
Hypercube). The details of the program will depend on your response.
If you plan to participate please provide the following information:
- name
- e-mail address
- phone number
- title of your presentation/your main interests
- long abstract (by July 1)
to one of the organizers listed below.
The participation in the workshop is free.
No meals, except for coffee and doughnuts, will be provided.
Andrzej Ciepielewski, SMU Dallas (on leave from SICS/Sweden) (214) 692 3716
andrzej@smu.edu
Bob Kessler, University of Utah
kessler@cs.utah.edu
Evan Tick, University of Oregon (503) 3463973
tick@cs.uoregon.edu
John Conery, University of Oregon (503) 346 4436
conery@cs.uoregon.edu
About Eugene
------------
Eugene, Oregon is a small university town with an airport,
inexpensive hotels, good hiking and beautiful summer weather.
Sample of hotels:
Eugene Hilton (503-683-3669): downtown, 20 min walk from CIS building,
group rate: single $58, double = $68.
New Oregon (Best Western) (503-683-3669), across street from CIS building,
standard rate: single = $41, double = $53.
Accomodation in students dorms may be possible --- please
inquire about this by early July so we can work on it.
Please DISTRIBUTE to others who could be interested !!!
∂24-Apr-90 1113 vivluo@Sunburn.Stanford.EDU Undergraduate CS Lunch Social
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Apr 90 11:13:21 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA06669; Tue, 24 Apr 90 11:13:09 -0700
Sender: Vivian Luo <vivluo@Sunburn.Stanford.EDU>
Date: Tue, 24 Apr 1990 11:13:08 PDT
From: luo@cs.Stanford.EDU
Reply-To: luo@cs.Stanford.EDU
To: faculty@cs.Stanford.EDU
Subject: Undergraduate CS Lunch Social
Message-Id: <CMM.0.88.640980788.vivluo@Sunburn.Stanford.EDU>
Dear CS Faculty,
Please join us for lunch!
Undergraduate CS Lunch Social
Wednesday, May 2
Noon
Terman Grove
Questions? Send email to luo@cs.
Hope to see you there!
-vivian
∂24-Apr-90 1347 sweeney@cis.Stanford.EDU TODAY EE 310 SEMINAR - ON: REACTOR MODELING
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 24 Apr 90 13:47:01 PDT
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Tue, 24 Apr 90 13:44:49 PDT
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA09299; Tue, 24 Apr 90 13:45:06 PDT
Message-Id: <9004242045.AA09299@cis.Stanford.EDU>
To: ee-faculty@sierra.Stanford.EDU, cis-people@glacier.Stanford.EDU
Subject: TODAY EE 310 SEMINAR - ON: REACTOR MODELING
Date: Tue, 24 Apr 90 13:45:03 PDT
From: sweeney@cis.Stanford.EDU
--------
------- Forwarded Message
EE 310 SEMINAR
ON: REACTOR MODELING
BY: ART SHERMAN, VARIAN
IN: McCullough 128
ON: April 24, 1990
AT: 4:15 P.M.
------- End of Forwarded Message
∂25-Apr-90 0754 der@beren.stanford.edu internships
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Apr 90 07:54:41 PDT
Received: from psych.Stanford.EDU by russell.Stanford.EDU (4.1/inc-1.0)
id AA24911; Wed, 25 Apr 90 07:57:20 PDT
Received: from beren. by psych.Stanford.EDU (3.2/4.7); Wed, 25 Apr 90 07:55:13 PDT
Received: by beren. (4.0/SMI-4.0)
id AA19303; Wed, 25 Apr 90 07:55:33 PDT
Date: Wed, 25 Apr 90 07:55:33 PDT
From: der@beren.stanford.edu (Dave Rumelhart)
Message-Id: <9004251455.AA19303@beren.>
To: HELEN@CSLI.Stanford.EDU
Cc: ssp-students@russell.Stanford.EDU, ssp-faculty@russell.Stanford.EDU
In-Reply-To: Helen Nissenbaum's message of Tue 17 Apr 90 09:23:57-PDT <640373037.0.HELEN@CSLI.Stanford.EDU>
Subject: internships
Helen,
Just a note concerning Yuko Munakata's application for an
internship. I have agreed to work with her. I think her project is
interesting. I suspect that it will be more interesting by the time it is
finished. She is an outstanding student I wish to encourage.
der
∂25-Apr-90 0921 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call for Papers
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Apr 90 09:21:00 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23648; Wed, 25 Apr 90 09:21:11 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27254; Wed, 25 Apr 90 09:20:42 -0700
Message-Id: <9004251620.AA27254@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0562; Wed, 25 Apr 90 11:18:07 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0504; Wed, 25 Apr 90 11:18:03 CDT
Date: Wed, 25 Apr 90 11:16:35 CDT
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
CSC '91 Publicity Committee <I01BAILE@ETSU.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORYNT@YKTVMX
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: CSC '91 Publicity Committee <I01BAILE%ETSU.BITNET@VM1.NoDak.EDU>
Subject: Call for Papers
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
ACM/CSC 91
San Antonio Convention Center
on the Beautiful San Antonio River
San Antonio,Texas
March 5 - 9, 1991
The Association for Computing Machinery (ACM) has sponsored
the Computer Science Conference (CSC) since 1973. ACM/CSC 91
will be its 19th annual conference. This conference provides an
excellent environment for interaction among computer researchers,
computer science educators, corporate executives and students from
industry, education and research organizations. The conference
site is at the San Antonio Convention Center which is located by
the beautiful San Antonio River, a romantic, scenic Riverwalk at
the center of the downtown area. Hundreds of shops and many hotels
encircle the river and convention center. San Antonio, one of the
most unique cities in North America, will attract around 3,000
computer scientists from around the world to this well-established,
prestigious conference.
The activities of the conference consist of:
I. Technical Sessions
(a) Research paper presentations
(b) Technical panel discussions
(c) Keynote speeches
(d) Turing Award lecture
(e) Research paper poster sessions
(f) Monday tutorials and evening seminars
(g) Funding agency sessions
(h) SIG's sessions
(i) SIGCSE/91 symposium
II. Technical Tracks: Systems, Architectures, Theory of
Computations, Software, Human Interfaces, Applications,
Artificial Intelligence
III. Computer and Educational Exhibits
IV. Department Chairs' Program
V. Employment Registers - Industrial, Educational, and Research
VI. ACM Scholastic Programming Contest
VII. Evening Socials
VIII. Students' Program
IX. Tours - Sea World, The Alamo and other historical missions,
San Antonio Riverwalk, La Villita, and Mercado.
X. ACM/CSC 91 Proceedings Publications
XI. Journal Publications for Outstanding Papers
Program Chair: Conference Chair:
Richard Brice C.J. Hwang
MCC Chairman
3500 West Balcones Center Dr. Department of Computer Science
Austin, TX 78759-6509 Southwest Texas State University
(512) 338-3429 San Marcos, TX 78666
(Bitnet) RSB@MCC.COM (512) 245-3409
(Bitnet) CH01@SWTEXAS
Publicity Chair:
Gordon L. (Don) Bailes
Box 23,830A, CS Dept.
East Tennessee State University
Johnson City, TN 37614
(Bitnet) I01BAILE@ETSU
∂25-Apr-90 1037 LOGMTC-mailer MSRI Seminar Announcements, Apr 30 - May 4
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 25 Apr 90 10:37:11 PDT
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA06276; Wed, 25 Apr 90 10:35:59 PDT
Received: by msri.org (4.0/SMI-4.0)
id AA04887; Wed, 25 Apr 90 10:32:55 PDT
Date: Wed, 25 Apr 90 10:32:55 PDT
From: david@msri.org (David Mostardi)
Message-Id: <9004251732.AA04887@msri.org>
To: weekly@msri.org
Subject: MSRI Seminar Announcements, Apr 30 - May 4
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Seminar Announcements for April 30 - May 4, 1990
Monday, April 30
RECURSION THEORY 11:00 MSRI Lecture Hall
D. Seetapun "The Undecidability of the R. E. Degrees"
MSRI-EVANS MONDAY LECTURE 4:15 60 Evans
L. Blum "Godel for Mathematicians"
Tuesday, May 1
INFORMAL CORE MODEL SEMINAR 10:30 MSRI Seminar Room
P. D. Welch "Fine Structure" X
MODEL THEORY 1:00 MSRI Seminar Room
A. Wilkie "On Definability in Expansions of the Real Field"
Wednesday, May 2
RECURSION THEORY 1:30 MSRI Lecture Hall
M. Lerman "The Decidability of the E - Theory of the R.E. Degrees with
Jump Relations"
Thursday, May 3
MODEL THEORY 1:00 MSRI Seminar Room
P. Scowcroft "Eliminating Imaginaries Over the p-Adic Numbers"
INFORMAL CORE MODEL SEMINAR 2:30 MSRI Seminar Room
P. D. Welch "Fine Structure" XI
MATHEMATICS COLLOQUIUM 4:10 60 Evans Hall
L. van den Dries "p-Adic Subanalytic Sets With Applications"
Friday, May 4
NO LECTURES SCHEDULED FOR TODAY
∂25-Apr-90 1056 @Sunburn.Stanford.EDU:winograd@loire.stanford.edu NSF CISE grant
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Apr 90 10:56:24 PDT
Received: from Loire.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00252; Wed, 25 Apr 90 10:56:12 -0700
Received: by loire.stanford.edu (5.59/25-eef) id AA05833; Wed, 25 Apr 90 10:57:48 PDT
Date: Wed, 25 Apr 90 10:57:48 PDT
Message-Id: <9004251757.AA05833@loire.stanford.edu>
From: Terry Winograd <Winograd@csli.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: NSF CISE grant
I am thinking of submitting a proposal to the NSF Computer and
Information Science and Engineering Educational Infrastructure
Program to develop a course on human-computer interaction design.
The objective of the CISE Educational Infrastructure program is to
stimulate innovative educatational activities which address the
problems of undergraduate instruction in the fields of computer
and information science, computer engineering, computational
science and artificial intelligence.
The announcement states:
At the current level of funding for this program only a small
number of proposals will be selected for support. Only one
proposal per institution will be accepted in any one year.
I read that as saying they will only review one proposal per
institution, not that they will only fund one. I thought it was worth
checking to see if anyone else was planning to submit one from
Stanford. If so, please let me know. Depending on the topic, it might
be possible to coordinate. If you hadn't heard of the program or
aren't interested, ignore this message. If you are interested in
finding out more about the program in general, Joyce Chandler has
copies of the announcement.
Thanks. --t
∂25-Apr-90 1138 chandler@Sunburn.Stanford.EDU CSD Retreat
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Apr 90 11:38:43 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA01763; Wed, 25 Apr 90 11:39:20 -0700
Date: Wed, 25 Apr 1990 11:39:19 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: retreatattendees1990@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: CSD Retreat
Message-Id: <CMM.0.88.641068759.chandler@Sunburn.Stanford.EDU>
Please bear with me for one last detail. Dinner Friday night will be served
in a private dining room. Please choose one entree:
1. New York Strip Steak with Peppercorn Demi-Glaze
or
2. Grilled Swordfish Steak with Tomatillo Salsa
Dinner Saturday will be a buffet featuring Prime Rib (but including other
entrees as well). I will make a reservation for those of you who plan to be
there.
Thanks much.
Joyce
∂25-Apr-90 1407 stager@Sunburn.Stanford.EDU Preliminary Class Lists
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Apr 90 14:07:26 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08276; Wed, 25 Apr 90 14:07:22 -0700
Date: Wed, 25 Apr 1990 14:07:22 PDT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: stager@Sunburn.Stanford.EDU
Subject: Preliminary Class Lists
Message-Id: <CMM.0.88.641077642.stager@Sunburn.Stanford.EDU>
Spring Quarter Preliminary Class Lists have arrived, and will be sent out
today and tomorrow (Wednesday and Thursday). Please let me know if your
class list doesn't show up within the next few days.
Claire
∂25-Apr-90 1613 ingrid@russell.Stanford.EDU CSLI Calendar, 26 April 1990, vol. 5:25
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 Apr 90 16:13:06 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA01642; Wed, 25 Apr 90 15:25:20 PDT
Date: Wed, 25 Apr 90 15:25:20 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9004252225.AA01642@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 26 April 1990, vol. 5:25
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
26 April 1990 Stanford Vol. 5, No. 25
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 26 APRIL 1990
12:00 noon TINLunch
Cordura 100 Truth Makers for Modal Propositions
Bernard Linsky
Visiting Scholar from the University of Alberta
(linsky@csli.stanford.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 2
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Developments in Phonological and
Morphological Theory
Speakers: Paul Kiparsky and Bill Poser
(kiparsky@csli.stanford.edu, poser@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 3 MAY 1990
12:00 noon TINLunch
Cordura 100 Fuzzy Logic and its Applications
Lotfi A. Zadeh
Computer Science Division
University of California, Berkeley
(zadeh@ucbarpa.berkeley.edu)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 3
led by Stanley Peters
(peters@csli.stanford.edu)
Abstract below
4:15 p.m. CSLI Colloquium
Cordura 100 Metaphor Comprehension by Neural Networks
Kouichi Doi
Department of Electrical Engineering
University of Tokyo
(doi@mtl.t.u-tokyo.ac.jp)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Fuzzy Logic and its Applications
Lotfi A. Zadeh
Fuzzy logic has been, and continues to be, controversial. Regardless
of the controversy, it is finding many applications in fields ranging
from medical expert systems and image analysis to the control of
cement kilns and subway trains. In Japan, in particular, it is widely
used in industry and is the object of a large-scale
government-supported program to expand its applications.
A concept that plays a key role in many of the applications of fuzzy
logic is that of a linguistic variable, that is, a variable whose
values are words or sentences in a natural or synthetic language. To
illustrate, _age_ is a linguistic variable of its values labeled
_young_, _very young_, _quite young_, _not very old_, etc. In
general, a linguistic value may be viewed as a label of a possibility
distribution. What is important about such values is that the
meaning, i.e., the possibility distribution, of any linguistic value
may be computed from the meaning of the so-called primary terms, e.g.,
_young_ and its antonym, _old_.
The concept of a linguistic variable provides a computational
framework for describing the relation between two or more variables in
qualitative, linguistic terms. It is this framework that plays a
major role in many of the applications of fuzzy logic. In the final
analysis, what fuzzy logic offers is a much better model for human
reasoning -- most of which is fuzzy rather than precise -- than the
traditional logical systems, which are intolerant of imprecision and
partial truth.
____________
NEXT WEEK'S CSLI SEMINAR
Controversies in Natural-Language Research 3
led by Stanley Peters
Next week's seminar will consist of a panel discussion/debate among
Ron Kaplan, Lauri Karttunen, Martin Kay, Paul Kiparsky, and Bill Poser
about the computational tractability of morphological theory as
presented two weeks ago and the theoretical underpinnings of the
computational approach to morphology presented this week.
____________
NEXT WEEK'S CSLI COLLOQUIUM
Metaphor Comprehension by Neural Networks
Kouichi Doi
In this paper, we propose a method of metaphor comprehension by neural
networks. One metaphor has many meanings, and an associative network
is useful to find candidates as the real meaning of the metaphor.
In our method, input sentences made of characters are decomposed into
independent words, and are given a neural network. Then the neural
network is constructed in the following way: situation and context are
treated as the activation values of neurons. Synonyms are treated as
the assignment of each neuron. When meanings of words alter, we treat
such cases by changing connective coefficients between neurons.
Candidates of interpretation are output from the neural network.
Among the candidates, a valid meaning is chosen based on the mixture
theory. Our network has a simpler structure, and the network
converges faster than ever. The result of the experiment by network
is valid.
____________
SYMBOLIC SYSTEMS FORUM
Applications of Nonwellfounded Sets in Symbolic Systems
Jon Barwise
(barwise@csli.stanford.edu)
Thursday, 26 April, 4:15 p.m.
Building 60, Room 61G
Nonwellfounded sets have been in ill repute for seventy-odd years.
The reason is that they were mistakenly implicated in the paradoxes of
set theory. In recent years, though, they have been rehabilitated.
This rehabilitation has been brought about in part by theoretical work
in set theory, where Aczel and others have shown how to make sense of
such sets, and in part because of the applications that are being
found for them in the symbolic sciences. In this elementary talk, I
will motivate them by means of example, and discuss the theory of
nonwellfounded sets a bit.
Next week: The Neurophysiology of Conscious Experience, Ben Libet,
Physiology, University of California, San Francisco.
Change in calendar: The announced dates of the talks by Professors
Girard and Dupuy in May have been switched. Professor Dupuy will be
speaking on 17 May (On the Self-Deconstruction of the Symbolic Order),
and Professor Girard will give his talk on 24 May (The Genesis of
Symbolic Forms in Human Culture).
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Ditransitives and Linking Theory
Steve Wechsler
(wechsler@csli.stanford.edu)
Friday, 27 April, 3:30 p.m.
Cordura 100
The goal of linking theory is to explain the "projection from the
lexical entries of predicators to the morphosyntax of the clauses or
phrases that those predicators head. A reasonable desideratum for
such a theory is that each semantic feature used in the grammar must
either (i) be definable in terms of universal semantic primitives
(which perhaps should be expected to meet a condition of
epistemological priority (Chomsky 1981)); or (ii) be associated with a
specific linguistic form. I will propose a variant of Direct Linking
Theory (Kiparsky 1989) that meets this criterion. Thematic role types
are fine-grained relations associated with linguistic forms --
typically Ps and semantic cases, sometimes special agreement morphemes
and configurational linkers -- so they are of type (ii).
Crosslinguistic principles of term (subject and object) linking are
stated in semantic features that meet (i). Since type (i) and (ii)
features are theoretically distinct, hierarchies like "agent -->
recipient --> theme" are convenient descriptive devices but not part
of grammar.
This theory will be applied to the analysis of ditransitives. First I
will give an account of the English dative/benefactive construction,
which captures its productivity in terms of a configurational "dative"
linker, without positing a derivation or operation at any level of
grammar. Then I will turn to Swedish, which has not only the dative
linker but incorporated Ps as well:
(1a) Man tog chefskapet fraon honom.
one took the-headship from him
(1b) Man fraon-tog honom chefskapet.
one from-took him the-headship
"They took the headship from him."
On the proposed theory the incorporated P, like the unincorporated
one, is a semantic linker (Ostler 1979) or equivalently a copredicator
(Gawron 1986), which is thus available to link a postverbal NP bearing
the appropriate role. This correctly predicts that (1b) has two
passives, "The headship was from-taken him" and "He was from-taken the
headship." Finally, I will look at the implications of this theory
for the analysis of applicatives and "relational preverbs" (Craig and
Hale 1988).
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
The Frame Problem:
From Toy Worlds to a General Theory
Vladimir Lifschitz
Department of Computer Science
Stanford University
(val@sail.stanford.edu)
Monday, 30 April, 2:30 p.m.
Margaret Jacks Hall 252
Ideas related to formalizing action and change are usually tested on
"toy domains," such as the blocks world or the "Yale shooting"
example. We will discuss what appears to be the most promising
available formalization of the blocks world and investigate how
general it is. We will see that that solution is applicable to a
whole class of domains involving situations and actions, of which the
blocks world is only one example. The class is described in terms of
purely formal, mostly syntactic, properties of axioms.
____________
POETICS WORKSHOP
A Coherence Analysis of a Sonnet by Milton
Jerry Hobbs
SRI International
(hobbs@ai.sri.com)
Tuesday, 1 May, 4:00 p.m.
Ventura 17
The poetics workshop will resume meeting this quarter, after its
winter quarter hibernation. The workshop involves people from various
departments with a common interest in such formal properties of poetry
as meter, rhyme, alliteration, and parallelism, and their relation to
syntactic and phonological structures of language. It meets every
other week for informal presentation and discussion of current
research.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Conceptual Issues in the Divided Mutagenesis
of Bacteria Controversy
Sahotra Sarkar
Boston University
Tuesday, 1 May, 4:15 p.m
Building 380, Room 380F
(Note unusual day, place, and time)
No abstract available.
____________
SYNTAX WORKSHOP
What's in a Word? On the Syntax of Bantu Noun Class Prefixes
Joan Bresnan and Sam A. Mchombo
(bresnan@csli.stanford.edu, mchombo@csli.stanford.edu)
Tuesday, 1 May, 7:30 p.m.
Cordura 100
In virtually the entire tradition of Bantu linguistics, the gender or
class markers of Bantu nouns are analyzed as prefixes morphologically
bound to noun stems. Myers (1987) proposes an alternative syntactic
analysis, according to which the class markers are syntactically
independent words (like articles or particles) that are associated
with their noun stems only phonologically and not morphologically.
The syntactic analysis of the noun class markers raises the question
of what criteria to use in identifying words. The Principle of
Lexical Integrity, which states that the internal structure of words
is opaque to syntax, provides a rich set of criteria, which Myers
(1987) has not exploited. According to these criteria, neither the
morphological analysis nor the syntactic analysis of class markers is
completely correct by itself. Instead, there is compelling evidence
from Chichewa for the syntactic analysis of the locative class
markers, and for the morphological analysis of all other noun class
markers.
We compare two alternative explanations for this state of
affairs -- that locatives belong to a distinct category in syntax from
nouns (along the lines of work by Baker and Stowell), or that
locatives are simply incompletely morphologized noun class markers
(following a hypothesis of Greenberg). The evidence clearly supports
the latter hypothesis.
The next workshop will be Tuesday, 15 May, when Robert Van Valin will
talk.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Context, Activity, and Participation
Chuck and Candy Goodwin
Xerox PARC and University of South Carolina
Wednesday, 2 May, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
send
∂26-Apr-90 0818 pollock@Sunburn.Stanford.EDU 1990/91 Sabbatical Leave/Leave w/o Salary/Research Offset plans
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Apr 90 08:18:37 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA06305; Thu, 26 Apr 90 08:18:40 -0700
Date: Thu, 26 Apr 1990 8:18:39 PDT
From: "Laura L. Pollock" <pollock@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: 1990/91 Sabbatical Leave/Leave w/o Salary/Research Offset plans
Message-Id: <CMM.0.88.641143119.pollock@Sunburn.Stanford.EDU>
Please inform me of your plans for academic year 1990/91 sabbaticals,
LWOS, and if you have any idea what your research offsets
might be. I know that these plans may change and often do but any
ideas you have at present could help in the planning for the budget of
90/91.
If I could hear from you by 5/4 it would be great!
Thank you.
Laura
∂26-Apr-90 0902 LOGMTC-mailer new address
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Apr 90 09:02:33 PDT
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07428; Thu, 26 Apr 90 09:03:29 -0700
Message-Id: <1vO7lL@SAIL.Stanford.EDU>
Date: 26 Apr 90 0902 PDT
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Subject: new address
To: logic@CS.STANFORD.EDU
The Stanford logic and mtc mailing list now has a new and relatively
permanent address -- logic@cs.stanford.edu ---. logmtc@sail will continue
to work but SAIL is disappearing soon and you should get used to using
the new address. Also logic@csli is no longer an alias for logmtc@sail,
it is being used for other purposes and mail sent there will go another
mailing list.
∂26-Apr-90 1132 LOGMTC-mailer please remove me from this list
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Apr 90 11:32:01 PDT
Received: from ibm.com by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12158; Thu, 26 Apr 90 11:32:56 -0700
Message-Id: <9004261832.AA12158@Sunburn.Stanford.EDU>
Received: from YKTVMT by IBM.COM (IBM VM SMTP R1.2.1MX) with BSMTP id 4961; Thu, 26 Apr 90 11:34:04 PDT
Date: Thu, 26 Apr 90 14:32:09 EDT
From: SELKER@IBM.COM
To: logic@cs.stanford.edu
Subject: please remove me from this list
buy bye
∂26-Apr-90 1602 @Sunburn.Stanford.EDU:pratt@sydney.stanford.edu Marc Levoy--dinner
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 26 Apr 90 16:01:59 PDT
Received: from Sydney.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23104; Thu, 26 Apr 90 16:01:59 -0700
Received: by sydney.stanford.edu (5.59/25-eef) id AA00743; Thu, 26 Apr 90 16:01:55 PDT
Date: Thu, 26 Apr 90 16:01:55 PDT
From: Vaughan Pratt <pratt@sydney.Stanford.EDU>
Message-Id: <9004262301.AA00743@sydney.stanford.edu>
To: faculty@cs.Stanford.EDU
Subject: Marc Levoy--dinner
I'll be taking Marc Levoy to dinner tonight. Please let me know if you would
like to join us. Marc is interviewing for a faculty position. For those of
you who missed his talk this morning on volume visualization, you missed
a very impressive presentation, both visually and technically.
-v
∂27-Apr-90 0806 chandler@Sunburn.Stanford.EDU Facutly Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 08:06:40 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04594; Fri, 27 Apr 90 08:06:55 -0700
Date: Fri, 27 Apr 1990 8:06:54 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU, stefif@cs.Stanford.EDU,
psz@sumex-aim.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com,
cn.phy@forsythe.Stanford.EDU
Subject: Facutly Lunch
Message-Id: <CMM.0.88.641228814.chandler@Sunburn.Stanford.EDU>
Just a reminder.....
Henry Lowood who is Head of the Physics Library will be coming by to talk to
us about Technology Archives.
See you next Tuesday, 5/1 ... 12:15 in Margaret Jacks Hall room 146.
∂27-Apr-90 0830 LOGMTC-mailer administrative matters
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 08:30:23 PDT
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05407; Fri, 27 Apr 90 08:31:16 -0700
Message-Id: <lOWNA@SAIL.Stanford.EDU>
Date: 27 Apr 90 0830 PDT
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Subject: administrative matters
To: logic@CS.Stanford.EDU
As is the STANDARD convention with mailing lists, associated with
logic@cs is logic-request@cs. If you have administrative requests
(adding or deleting entries ...) PLEASE send them to logic-request@cs and
NOT to logic@cs. Messages sent to logic-request go only to the
owner/maintainer of the list (currently me) and not to the entire list.
∂27-Apr-90 1329 chandler@Sunburn.Stanford.EDU Exchange with the USSR
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 13:29:46 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15020; Fri, 27 Apr 90 13:29:58 -0700
Date: Fri, 27 Apr 1990 13:29:58 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Exchange with the USSR
Message-Id: <CMM.0.88.641248198.chandler@Sunburn.Stanford.EDU>
Nils has received some information from the Office of the Vice Provost and
Dean of Research in connection with an invitation to initiate scientific
exchanges between faculty and students from Stanford and the Siberian Branch
of the USSR Academy of Sciences. I have copies of their letter and the
relevant section of the brochure. If you are interested please let me know
and I will forward you all the information I have.
∂27-Apr-90 1351 chandler@Sunburn.Stanford.EDU Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 13:51:35 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15847; Fri, 27 Apr 90 13:51:50 -0700
Date: Fri, 27 Apr 1990 13:51:49 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Publication
Message-Id: <CMM.0.88.641249509.chandler@Sunburn.Stanford.EDU>
I have just received the following publication. Let me know if you would
like to see a copy of it:
NACSIS: NSF Gateway to Japan's University-Based National Science Information
System (Program Announcement).
∂27-Apr-90 1506 carlstea@sierra.Stanford.EDU Parking
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 15:03:48 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Fri, 27 Apr 90 15:01:12 PDT
Date: Fri, 27 Apr 90 15:01:12 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Cc: carlstead@sierra.Stanford.EDU
Subject: Parking
Message-Id: <CMM.0.88.641253671.carlstea@>
The last open hearing on the proposed parking changes and charges will be
Tuesday, May 1st on-going from 11:30 to 1:30 in Shultz Auditorium, Med Ctr.
(I am told that is over near the new parking structure on Campus Drive.)
The proposed changes and probably fee increase will hit hard at most
employees, particularly non-exempt office personnel, and especially
working mothers, the single parents, those who must use a car to commute
because there is no convenient and quick way to get to work, the older
workers, those who work non-standard shifts, those caring for elderly
parents in their homes or nursing homes, in fact almost everyone. The
Parking Committee in the past is usually made up of faculty, high level
administrators, and students.
Tuesday is the last chance to say something - or if you have an opinion,
please send it via electronic mail to hk.jpf@forsythe. Acc. to the
Campus Report, some of the proposals include:
a. Reducing parking demand with Marguerite improvements, new shuttle
services and incentives for carpools, bicyclists, transit riders,
and pedestrians. "If these programs do not reduce demand enough to
meet the target, a rational system will have to be developed, "
the committee warns. (Quote from Campus Report).
b. Moving parking farther from the congested campus center.
c. Reducing parking supply consistent with the goal of reducing demand
by 10%. In the year 2,000, the committee hopes to have the supply
reduced to .59 spaces per person from .65 spaces per person.
d. Changing funding priorities and policies to redirect money earmarked
for parking construction into TDM (Transportation Demand Management)
programs.
e. Chaning land use practices to acknowledge parking in the University's
long-term plans as a legitimate land use. (Translation - open space
and outlying fields.)
f. Collecting money from parking tickets. The county of Santa Clara
now keeps the $13 from each Stanford parking ticket. With county
permission, a surcharge could be added to offset the cost of
parking enforcement.
g. Designation of some of the "choicest" A-lot parking spaces to
carpool only.
h. Free "D" lot stickers in outlying parking lots which will have to
be paved and lighted. Workers will have to use bikes, walk, or
take a shuttle.
i. Experimental shuttle from faculty housing to campus.
j. Still to be determined is the new cost of tthe 90-91 stickers.
This list is from the Campus Report.
∂27-Apr-90 1618 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU leadership course
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 16:18:14 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21271; Fri, 27 Apr 90 16:18:13 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA17676; Fri, 27 Apr 90 16:17:03 PDT
Date: Fri, 27 Apr 90 16:17:03 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004272317.AA17676@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: leadership course
The Dean's Office just sent me the following request.
Anyone interested? -Nils
-----
Leadership Training Course
We spoke with you earlier about our plan to provide an opportunity for a broader
exposure by faculty, including potential future chairs, to the workings of the
University, at least at the School level. Accordingly, we invite you to nominate
one, or in the case of the larger departments two, individuals who might be
expected in the next, say, five years to assume leadership roles as department
chairs or laboratory or division directors, or otherwise become movers and
shakers to participate in a trial version of this program.
What we have in mind covering ranges from nuts and bolts, such as budgets,
preparation of appointment and promotion papers, and the organization of the
Dean's office, through Human Resources and Affirmative Action concerns, to
discussions with the Dean and hopefully the Provost on their visions for the School
and the University. This might take from a few days to a week of total time,
spread out as dictated by schedules.
We would welcome your nominations and also your suggestions as to what might
be included in the program by May 15th. Also, let us know if you would be
interested in auditing yourself.
Because of repositioning, some potential topics may be moving targets.
Nevertheless, we would like to start the program in late spring or early summer
while we wait for the smoke to clear.
Jim Gibbons
Charles Kruger
∂27-Apr-90 1619 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU commencement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 16:19:53 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21427; Fri, 27 Apr 90 16:20:01 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA17679; Fri, 27 Apr 90 16:18:51 PDT
Date: Fri, 27 Apr 90 16:18:51 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004272318.AA17679@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: commencement
Passing along a message from the Dean (which has
my strong support):
-----
Begin forwarded message:
Date: Fri, 27 Apr 90 14:09:15 PDT
From: gibbons@sierra.stanford.edu (James F. Gibbons)
To: xcomx@sierra.stanford.edu
Cc: cloutier@sierra.stanford.edu
Subject: commencement
Friends:
You have received a memo from Dave Freyberg asking for volunteers
for graduation marshals. I want to underline the importance of this for the
students,. the department, the School and the U. More than that, I want
to urge faculty attendance, and especially those faculty who will have
PhD students graduating. Some departments have the supervisor hood the
student, which is a great custom. But whether that custom is followed
or not, I do hope each of you will issue a special request to your
department to please attend the graduation ceremonies if at all possible.
∂27-Apr-90 1658 carlstea@sierra.Stanford.EDU Parking typing error
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 16:58:05 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Fri, 27 Apr 90 16:56:12 PDT
Date: Fri, 27 Apr 90 16:56:12 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Subject: Parking typing error
Message-Id: <CMM.0.88.641260570.carlstea@>
Item one should have read, ...." a rationing system will have to be
developed."
∂27-Apr-90 1733 JMC@SAIL.Stanford.EDU re: Parking
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 17:33:04 PDT
Received: from SAIL.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Fri, 27 Apr 90 17:30:53 PDT
Message-Id: <vO#HE@SAIL.Stanford.EDU>
Date: 27 Apr 90 1729 PDT
From: John McCarthy <JMC@SAIL.Stanford.EDU>
Subject: re: Parking
To: carlstea@SIERRA.STANFORD.EDU, ee-faculty@SIERRA.STANFORD.EDU,
ee-adminlist@SIERRA.STANFORD.EDU
[In reply to message from carlstea@sierra.Stanford.EDU sent Fri, 27 Apr 90 15:01:12 PDT.]
The University's new parking policy is probably based on the
popular, though false, idea that the individual transportation
provided by the automobile is on its way out. It is appropriate
for engineering departments to try to persuade Stanford to be
more objective about this rather than just joining a bandwagon.
∂27-Apr-90 1738 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU faculty meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 17:38:44 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23927; Fri, 27 Apr 90 17:39:29 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA17750; Fri, 27 Apr 90 17:38:19 PDT
Date: Fri, 27 Apr 90 17:38:19 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9004280038.AA17750@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: faculty meeting
Cc: chandler@cs.stanford.edu
You will recall that we have a faculty meeting scheduled
for 2:30 p.m. on Tuesday, May 1. And a good thing
too! The Systems Search Committee has some
recommendations that they want to bring to the
faculty. Papers on the recommended candidates
will be (I am told) in Joyce Chandler's office shortly
after noon on Monday. Please stop by and look these
over in order to be prepared for discussion and (the
systems people hope) a decision on Tuesday.
Time permitting, we will also deal with the matter
of consulting and courtesy faculty at the meeting.
-Nils
∂27-Apr-90 1742 @Sunburn.Stanford.EDU:hayes@roo.parc.xerox.com leadership course
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 17:42:32 PDT
Received: from arisia.Xerox.COM by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23950; Fri, 27 Apr 90 17:42:26 -0700
Received: from roo.parc.Xerox.COM by arisia.Xerox.COM with SMTP
(5.61+/IDA-1.2.8/gandalf) id AA24597; Fri, 27 Apr 90 17:42:12 -0700
Received: by roo.parc.xerox.com
(5.61+/IDA-1.2.8/gandalf) id AA05367; Fri, 27 Apr 90 17:42:02 PDT
Message-Id: <9004280042.AA05367@roo.parc.xerox.com>
Date: Fri, 27 Apr 90 17:42:02 PDT
From: <hayes@parc.xerox.com>
Reply-To: hayes@parc.xerox.com
To: nilsson@tenaya.Stanford.EDU
Cc: faculty@cs.stanford.edu
In-Reply-To: Nils Nilsson's message of Fri, 27 Apr 90 16:17:03 PDT <9004272317.AA17676@Tenaya.Stanford.EDU>
Subject: leadership course
That sounds absolutely fascinating. I wish Rochester had had such a course
which I could have attended before taking up my chair there: I had to learn
all this stuff by trial and error and folk recipes. Let me encourage
anyone who is interested in organising anything to take it!
Pat
∂27-Apr-90 1744 grundy@csli.Stanford.EDU Symbolic Systems Forum, May 3
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 27 Apr 90 17:44:40 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA26026; Fri, 27 Apr 90 17:40:27 PDT
Date: Fri 27 Apr 90 17:40:25-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum, May 3
To: grundy@csli.Stanford.EDU
Message-Id: <641266825.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, May 3, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Ben Libet, Physiology, UC San Francisco
Topic: "The Neurophysiology of Conscious Experience"
ABSTRACT
--------
The special requirements for cerebral activity to
elicit a conscious subjective experience have been
experimentally addressed, with intracranial studies in human
subjects. How the brain distinguishes conscious from
unconscious mental functions was also investigated. The
findings and their implications will be presented and
discussed.
Refreshments will be served.
Next week, May 10:
B. A. Huberman, Xerox Palo Alto Research Center
"The Problem of Idle Time"
If you would like to be added to the Symbolic Systems
Forum mailing list, send a note to Bill Grundy
(grundy@csli).
-------
∂28-Apr-90 0603 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM binomial primep
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 28 Apr 90 06:03:44 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 507535; 28 Apr 90 08:19:10 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 122808; Sat 28-Apr-90 05:10:48 PDT
Date: Sat, 28 Apr 90 05:10 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: binomial primep
To: "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Supersedes: <19900427082456.6.RWG@TSUNAMI.SPA.Symbolics.COM>
Comments: Retransmission of failed mail.
Message-ID: <19900428121053.1.RWG@TSUNAMI.SPA.Symbolics.COM>
Remember my conjecture that Binom(2n,n) = (-1)↑n mod 2n+1 iff primep(2n+1)?
Steve Skiena cooked it with n=2953. Ilan Vardi has now pushed the search
to n = 175000, with no further counterexamples. But more remarkably, he
has constructed two! (Stop: what class of primes has only two known
members? Well square them and set to 2n+1.) I think these (597324,
6163560) are the only known n where 2n+1 is composite, and Binom(2n, n)
= 1 mod 2n+1. (And 2953 the only one with residue -1.)
(The mystery primes: 1093 and 3511. Only exemplars of 2↑p=2 mod p↑2.)
∂30-Apr-90 1015 carlstea@sierra.Stanford.EDU Overwhelming response
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 10:15:04 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 30 Apr 90 10:12:11 PDT
Date: Mon, 30 Apr 90 10:12:11 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Subject: Overwhelming response
Message-Id: <CMM.0.88.641495530.carlstea@>
I have received numerous responses regarding the proposed parking changes
and charges, but I am only a member of the office support staff and can do
nothing about it. Please communicate your opinions to the Parking and
Transporation Committee- and to Ken Downs in the Dean's Office. There
are many, many School of Engineering employees who are not on the ee-admin
list EM mailing but whose opinions are very valuable and who should be
advised of what is going on. They too should have the opportunity of
expressing their opinions, because they will all be affected. If Stanford
makes it so difficult for employees to get to work, these highly trained
and qualified employees will go elsewhere - Sun Microsystems, H-P, Apple,
and on and on. Firms in Silicon Valley would very much like to have the
employees of the calber necessary to make the wheels of Stanford run and
keep the University going. Tomorrow is the last public hearing.
∂30-Apr-90 1020 carlstea@sierra.Stanford.EDU Parking
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 10:20:39 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 30 Apr 90 10:17:34 PDT
Date: Mon, 30 Apr 90 10:17:34 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 30 Apr 90 09:18:29 PDT
To: hk.jpf@forsythe
Cc: mccabe@sierra.Stanford.EDU, carlstead@sierra.Stanford.EDU
Subject: Parking
Message-Id: <CMM.0.88.641492308.mccabe@>
Resent-To: ee-faculty@sierra.Stanford.EDU, eeadminlist@sierra.Stanford.EDU
Resent-Date: Mon, 30 Apr 1990 10:17:33 PDT
Resent-From: "Mary L. Carlstead" <carlstea@@sierra.Stanford.EDU>
As a working mother mornings are crazy enough without adding a parking
problem. If you want to have parking at outlying lots and a shuttle
into campus you may want to consider the following: Have a shuttle
from the campus daycare centers into campus.
Patti McCabe
∂30-Apr-90 1101 chandler@Sunburn.Stanford.EDU CSL Faculty Candidates' Papers
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 11:01:05 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA26850; Mon, 30 Apr 90 11:01:43 -0700
Date: Mon, 30 Apr 1990 11:01:42 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: CSL Faculty Candidates' Papers
Message-Id: <CMM.0.88.641498502.chandler@Sunburn.Stanford.EDU>
Just to let you know that I have copies of two of the CSD faculty candidates'
papers in my office for your perusal: Brian Bershad and Marc Levoy.
∂30-Apr-90 1331 chandler@Sunburn.Stanford.EDU More papers.....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 13:30:26 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA01649; Mon, 30 Apr 90 13:31:02 -0700
Date: Mon, 30 Apr 1990 13:31:01 PDT
From: "Joyce R. Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: More papers.....
Message-Id: <CMM.0.88.641507461.chandler@Sunburn.Stanford.EDU>
I now have the Van Glabbeck papers/letters for your perusal before the
faculty meeting tomorrow.
∂30-Apr-90 1353 carlstea@sierra.Stanford.EDU [ judycla (Judith C. Clark: Parking ]
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 13:53:08 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 30 Apr 90 13:48:34 PDT
Date: Mon, 30 Apr 90 13:48:34 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Subject: [ judycla (Judith C. Clark: Parking ]
Message-Id: <CMM.0.88.641508512.carlstea@>
The following comments to the Parking Committee are forwarded to you with
permission of Judy Clark who works for Prof. Beasley.
---------------
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 30 Apr 90 08:09:32 PDT
Date: Mon, 30 Apr 90 08:09:32 PDT
From: judycla (Judith C. Clark)
To: hk.jpf@forsythe
Cc: carlstead@sierra
Subject: Parking
Message-Id: <CMM.0.88.641488171.judycla@>
While there is still time to make some comments on the proposed
parking changes I would like to add a few remarks, purely from a
personal point of view.
There is a substantial number of employees like myself who travel
some considerable distance to get to work each day. Not all of us
enjoy the daily commute but have very little option. Living in San
Jose and south of I280, public transit exists somewhere between very
little and nothing. In my area there is a handful of so-called Express
busses (to which I would probably have to drive) that would just about
triple the time it takes me to travel to Stanford by car. As I work
from 7 to 4 (at a minimum) and am already getting up at 5 a.m. the
thought of having to arise even earlier is not exactly inviting.
I have tried ride-sharing, for as long as my nerves would stand it.
Believe me, beginning the day dreading the drive to work is not the
way to go. Having noticed a sharp decline in driving standards over
the past few years I'm not sure I want to trust anyone else with my
life. Certainly there are good drivers out there, but I hate the thought
of finding out literally by hit and miss. Add to that, I rarely work a
straight 7-4 day, and I can't see a carpool willing to accommodate the times
I need to get here by 6:30 because I have a lot to get through, or that will
hang around and wait because some emergency is holding me up.
Stanford has to realize that there is a large percentage of its staff
who do not live on campus or within biking distance. I would love to be
able to walk to work, but I couldn't afford to live in this area in 1968
and I surely can't afford to do so now.
The single-car commuter is not going to disappear in a hurry. Trying to get
people to use public transit which is almost nonexistent in a lot of areas is
obviously not going to work. Actually, I have a feeling that if just
one-third of the present driving public decided to take public transit, the
system would not be able to cope with the number of passengers. So let's
stop making threats against drivers who have no option but to go it alone.
Judy Clark
∂30-Apr-90 1710 carlstea@sierra.Stanford.EDU Directions to Parking Hearing
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 17:10:14 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Mon, 30 Apr 90 17:07:48 PDT
Date: Mon, 30 Apr 90 17:07:48 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Subject: Directions to Parking Hearing
Message-Id: <CMM.0.88.641520467.carlstea@>
The hearing is in the Schultz Auditorium of the HRP Bldg. See map on p. 187
of the current Faculty-Staff phone book.
∂30-Apr-90 1714 jones@Sunburn.Stanford.EDU Mac Pluses available
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 17:14:46 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA12516; Mon, 30 Apr 90 17:14:45 -0700
Date: Mon, 30 Apr 1990 17:14:44 PDT
From: "H. Roy Jones" <jones@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: Mac Pluses available
Message-Id: <CMM.0.88.641520884.jones@Sunburn.Stanford.EDU>
The School has some Mac Plus to allocate. Although priority will probably be
given for academic uses, it is possible that requests will be met for
non-academic uses that fit in the general mission of the school. If you are
interested please send me a paragraph proposal outlining what you would like
them for.
Roy
∂30-Apr-90 1923 axwang@Theory.Stanford.EDU This week's talk
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 19:23:29 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22081; Mon, 30 Apr 90 19:15:29 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05164; Mon, 30 Apr 90 19:21:48 -0700
Message-Id: <9005010221.AA05164@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: This week's talk
Date: Mon, 30 Apr 90 19:21:43 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
The speaker at AFLB this week will be Howard Ho, from IBM Almaden.
AFLB will meet at its usual time and place: Thursday, 12:00pm, in
MJH 252.
Optimal Communications on Hypercubes
Ching-Tien Ho
IBM Almaden Research Center
San Jose, CA 95120
Many scientific computations can be characterized by local computation
steps interposed with a set of regular communication steps. If
frequently used communication primitives are implemented efficiently
then high-level parallel programming is feasible for a large class of
problems. In this talk, we demonstrate how parallel computing on
hypercubes can be made more convenient and efficient for a large class
of problems by providing a set of optimal communication primitives.
For many common communication patterns, we present optimal routing
algorithms which, in most cases, outperform the previous best known
algorithms by an order of O(log N) in an N processor hypercube. The
algorithms use the edge-disjoint spanning trees, the balanced tree or
the rotated binomial trees on hypercubes. The techniques used in the
algorithms are extensible to a large class of networks, and similar
optimal algorithms can be derived for multidimensional meshes/torus,
generalized hypercubes, folded hypercubes, butterflies and star
graphs.
The set of communication primitives includes broadcasting, reduction,
personalized communication (scatter/gather), transposition, dimension
rotation (shuffle), dimension reflection, conversion between various
encodings and dimension permutations. We present implementation
results on the Intel iPSC hypercube. Based on these efficient
communication primitives, we have also implemented several
applications such as matrix multiplication, matrix transpose,
tridiagonal systems solvers, and have a suite of algorithms for
various problem sizes and machine parameters.
∂30-Apr-90 2342 LOGMTC-mailer Seminar in Logic and Foundations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 Apr 90 23:42:09 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03093; Mon, 30 Apr 90 23:43:06 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA11792; Mon, 30 Apr 90 23:44:27 PDT
Date: Mon, 30 Apr 1990 23:44:26 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.641544266.sf@csli.stanford.edu>
Speaker: Dr. Nail Zamov, Kazan University, USSR
Title: "The use of resolution-type methods as decision procedures"
Time: Monday, May 7, 4:15-5:30 PM
Place: Room 381-T, first floor Math Bldg, Stanford
Abstract:
The complete strategy of the resolution method turns out to be useful as
a decision algorithm for a wide class of predicate formulas. This
algorithm can be applied to the modal logics S4, S5, and quantifier-free
fragments of set theory, among others, by embedding in the language of
predicate logic.
Some modifications of the resolution method (modal resolution, resolution
with skolemization) are proposed which are oriented to various applications.
Reminder:
The second seminar presentation by Prof. Yuri Matijasevich, on exponential
diophantine representation of r.e. sets, will take place Wed. May 2,
4:15-5:30 in Room 383N (3d floor Math lounge).
S. Feferman
∂01-May-90 1059 bergman@Sunburn.Stanford.EDU SPO Funding Newsletter
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 10:59:51 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA12593; Tue, 1 May 90 10:59:52 -0700
Date: Tue, 1 May 1990 10:59:51 PDT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: SPO Funding Newsletter
Message-Id: <CMM.0.88.641584791.bergman@Sunburn.Stanford.EDU>
SPO puts out a funding newsletter several times a year. The newsletter
contains information on funding opportunities which is gathered from
the Federal Registry, Commerce Business Daily, and direct contact with
sponsors. If you are interested in having your name added to the mailing
list for this newsletter, let me know.
-Sharon Bergman
∂01-May-90 1127 sweeney@cis.Stanford.EDU EE 310 Seminar today
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 11:27:28 PDT
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.1/4.7); Tue, 1 May 90 11:26:15 PDT
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA04240; Tue, 1 May 90 11:26:24 PDT
Date: Tue, 1 May 90 11:26:24 PDT
From: sweeney@cis.stanford.edu (Irene Sweeney)
Message-Id: <9005011826.AA04240@cis.Stanford.EDU>
To: ee-faculty@sierra.Stanford.EDU
Subject: EE 310 Seminar today
Cc: sweeney@cis.Stanford.EDU
PLEASE NOTE:
ROOM CHANGE FOR THIS WEEK - AEL 109
EE 310 SEMINAR
ON: STRESS IN THIN FILMS
BY: PAUL FLINN, INTEL
IN: AEL 109
DATE: TUESDAY, MAY 1, 1990
AT: 4:15 P.M.
∂01-May-90 1156 vivluo@Sunburn.Stanford.EDU Reminder: Lunch Social!
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 11:56:19 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14974; Tue, 1 May 90 11:55:48 -0700
Sender: Vivian Luo <vivluo@Sunburn.Stanford.EDU>
Date: Tue, 1 May 1990 11:55:48 PDT
From: luo@cs.Stanford.EDU
Reply-To: luo@cs.Stanford.EDU
To: faculty@Sunburn.Stanford.EDU
Subject: Reminder: Lunch Social!
Message-Id: <CMM.0.88.641588148.vivluo@Sunburn.Stanford.EDU>
Dear CS Faculty,
I hope you will join us for lunch tomorrow!
CS/CSE Lunch Social
for undergrads and faculty
Wednesday, May 2
Terman Grove, at Noon
See you there!
-vivian
∂01-May-90 1409 chandler@Sunburn.Stanford.EDU Re: Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 14:09:01 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18767; Tue, 1 May 90 14:08:24 -0700
Date: Tue, 1 May 1990 14:08:23 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: Pat Simmons <MPS@SAIL.Stanford.EDU>
Cc: csdlist@CS.STANFORD.EDU
Subject: Re: Bulletin Boards and First Aid Kits
In-Reply-To: Your message of 01 May 90 1344 PDT
Message-Id: <CMM.0.88.641596103.chandler@Sunburn.Stanford.EDU>
I don't know who my floor monitor is.....
∂01-May-90 1433 @Sunburn.Stanford.EDU:MPS@SAIL.Stanford.EDU Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 14:33:12 PDT
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18198; Tue, 1 May 90 13:55:29 -0700
Message-Id: <1rRr5t@SAIL.Stanford.EDU>
Date: 01 May 90 1344 PDT
From: Pat Simmons <MPS@SAIL.Stanford.EDU>
Subject: Bulletin Boards and First Aid Kits
To: csdlist@CS.STANFORD.EDU
The bulletin boards that were installed today outside the
bathrooms on the 2, 3, and 4th floors of MJH are for the
exclusive use of information dealing with safety and health
hazards. The information to be posted will be decided by
the safety committee and will be put on all 3 floors, plus
CSF.
Also installed were first aid kits in all the bathrooms on
the same three floors. If you find you need any of the items
contained in these kits, please feel free to use them. If
an item is not there, and should be, tell your floor monitor
who will then inform me and I will see that it is replaced.
Thank you.
Pat
Safety Committee
∂01-May-90 1509 @Sunburn.Stanford.EDU:mps@Gang-of-Four.Stanford.EDU Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 15:09:52 PDT
Received: from Gang-of-Four.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19937; Tue, 1 May 90 14:29:12 -0700
Received: by Gang-of-Four.Stanford.EDU (5.61/inc-1.0)
id AA02356; Tue, 1 May 90 14:29:04 -0700
Date: Tue, 1 May 90 14:29:04 -0700
From: mps@Gang-of-Four.Stanford.EDU (Pat Simmons)
Message-Id: <9005012129.AA02356@Gang-of-Four.Stanford.EDU>
To: chandler@Sunburn.Stanford.EDU
Cc: csdlist@CS.STANFORD.EDU
In-Reply-To: "R. Joyce Chandler"'s message of Tue, 1 May 1990 14:08:23 PDT <CMM.0.88.641596103.chandler@Sunburn.Stanford.EDU>
Subject: Bulletin Boards and First Aid Kits
Joycie
How dare you not know. As a matter of fact, no one else does either.
Until we have a safety meeting and announce it, you will all be in the
dark.
That is what you call putting the cart before the horse, but did I
ever do anything right?
∂01-May-90 1517 @Sunburn.Stanford.EDU:mps@Gang-of-Four.Stanford.EDU Floor Monitors
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 15:17:39 PDT
Received: from Gang-of-Four.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20367; Tue, 1 May 90 14:33:24 -0700
Received: by Gang-of-Four.Stanford.EDU (5.61/inc-1.0)
id AA02392; Tue, 1 May 90 14:33:15 -0700
Date: Tue, 1 May 90 14:33:15 -0700
From: mps@Gang-of-Four.Stanford.EDU (Pat Simmons)
Message-Id: <9005012133.AA02392@Gang-of-Four.Stanford.EDU>
To: csdlist@cs.Stanford.EDU
Subject: Floor Monitors
Sorry folks. After the Safety Meeting this month, we will have
postings on the bulletin boards, that should give you all the
information you will need regarding health and safety measures,
including who the monitors are. Thanks again.
Pat
∂01-May-90 1535 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report column, April 25,
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 15:35:37 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22571; Tue, 1 May 90 15:35:46 -0700
Date: Tue, 1 May 1990 15:35:45 PDT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: [AS.BTH@Forsythe.Stanford.EDU : SPO Campus Report column, April 25,
1990 ]
Message-Id: <CMM.0.88.641601345.bergman@Sunburn.Stanford.EDU>
FYI.
-Sharon Bergman
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
National Science Foundation Software Capitalization Grants
NSF's Directorate for Computer and Information Sciences and
Engineering plans to allocate up to $1,000,000 in FY 1990 to support
software capitalization. These funds will be used to supplement
existing grants and to support new grants. Requests for funding
under this activity should aim to provide better support and
availability of software to researchers and educators for academic
and other legitimate research purposes at a nominal fee. Specific
software capitalization activities that CISE will support include:
1) Upgrading Laboratory or Prototype Software; 2) Distributing
Software; and 3) Software Maintenance and Support. No posted
deadline.
1991-92 Fulbright Awards for the Soviet Union
At least 37 lecturing awards for exchanges with U.S.S.R. State
Committee for Public Education, Academy of Sciences, Academy of
Pedagogical Sciences, and the Ministry of Culture. All disciplines
are welcome. Deadline: June 15, 1990.
∂01-May-90 1657 @Sunburn.Stanford.EDU:RWF@SAIL.Stanford.EDU re: Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 16:57:09 PDT
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24018; Tue, 1 May 90 16:28:04 -0700
Message-Id: <hRtMp@SAIL.Stanford.EDU>
Date: 01 May 90 1626 PDT
From: Robert W Floyd <RWF@SAIL.Stanford.EDU>
Subject: re: Bulletin Boards and First Aid Kits
To: MPS@SAIL.Stanford.EDU, csdlist@CS.STANFORD.EDU
[In reply to message from MPS sent 01 May 90 1344 PDT.]
We didn't pay a zillion dollars for stained oak paneling
on the central core of MJH so that some committee could
put a bulletin board up on it. Please keep the bulletin boards
in less intrusive places, on the drywall or concrete.
For example, on the third floor, the hall toward the kitchen
would be seen regularly but would not ugly up any
major architectural features.
∂01-May-90 1726 @Sunburn.Stanford.EDU:connelly@Neon.Stanford.EDU Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 May 90 17:25:58 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25111; Tue, 1 May 90 16:59:30 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA18506; Tue, 1 May 90 16:59:17 -0700
Date: Tue, 1 May 90 16:59:17 -0700
From: Jay H Connelly <connelly@Neon.Stanford.EDU>
Message-Id: <9005012359.AA18506@Neon.Stanford.EDU>
To: RWF@SAIL.Stanford.EDU
Cc: MPS@SAIL.Stanford.EDU, csdlist@CS.STANFORD.EDU
In-Reply-To: Robert W Floyd's message of 01 May 90 1626 PDT <hRtMp@SAIL.Stanford.EDU>
Subject: Bulletin Boards and First Aid Kits
Please take this conversation to the electronic bboards as opposed to
personal mail boxes. csd.bboard might be a good place.
Jay Connelly
∂02-May-90 0959 hemenway@Sunburn.Stanford.EDU Final Results
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 09:59:41 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07047; Wed, 2 May 90 09:59:51 -0700
Date: Wed, 2 May 1990 9:59:50 PDT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: Final Results
Message-Id: <CMM.0.88.641667590.hemenway@Sunburn.Stanford.EDU>
I've appended below the final (I think, at least!) list of students
who have accepted our admission offer. We will have an incoming group
of 23 students. We had two students defer their admission for one
year so that they could study in England (Todd Feldman and Michelle
Wang) so, overall, our acceptance rate was quite good -- 25 out of
the 45 offers. I've also indicated below the plans of those students
who turned us down--
Sharon
INCOMING Ph.D. STUDENTS 1990-91
Name Interests Undergraduate School (MS School)
Agesen, Ole PSL NDS AARHUS UNIV (Aalborg Univ.)
Buvac, Sasa AI AA HARVARD UNIVERSITY
Cheshire, Stuart CG NDS UNIVERSITY OF CAMBRIDGE
Dabija, Vlad AI CL POLITECHNIC INSTITUTE OF BUCHAREST
Drakopoulos, John AI AA UNIVERSITY OF CRETE
Flournoy, Raymond CL AI HARVARD UNIVERSITY
French, Robert NDS PSL MIT
Govil, Manoj AA MTC IIT, KANPUR
Handley, Simon CG PSL UNIVERSITY OF AUCKLAND (Same)
Ho, Chian-Min AI DCS UNIV OF MANCHESTER INST SCI & TECH (Same)
Hoang, My Khanh AA OR WELLESLEY COLLEGE
Karger, David AA HARVARD UNIVERSITY
Lim, Amy DCS AA MIT (Same)
Magerman, David CL AI UNIVERSITY OF PENNSYLVANIA
McDonald, James AI MTC MICHIGAN STATE UNIVERSITY
Murphy, Brian PSL AA MIT (Same)
Pehoushek, Dan AI STANFORD UNIV/PURDUE UNIV
Ramkumar, GDS AA MTC IIT, MADRAS
Shyam, Bharat NDS OS IIT, BOMBAY
Srinivas, Sampath AI DA IIT, MADRAS (UC Berkeley)
Steiglitz, Mark NDS OS CORNELL UNIVERSITY
Torrie, Evan DCS PSL UNIVERSITY OF AUCKLAND
V, Ramesh MTC AA IIT, KANPUR
-- Admitted Students Who Did Not Accept Our Offer:
Arora, Sanjeev MTC AA MIT
-- going to UC Berkeley
Capoyleas, Vasilis AA UNIVERSITY OF LONDON (Rutgers Univ.)
-- going to Courant Inst.
Costello, Tom DCS AI TRINITY COLLEGE, DUBLIN
-- did not hear anything from
De Marcken, Carl CL NA MIT
-- did not hear anything from
Eisner, Jason AI CL HARVARD UNIVERSITY
-- going to Cambridge for 2 years. Interested in later re-applying.
Ghahramani, Zoubin AI CL UNIVERSITY OF PENNSYLVANIA
-- going to MIT
Gunopulos, Dimitrios MTC AA UNIVERSITY OF PATRAS
-- going to Princeton
Harchol, Mor AI AA BRANDEIS UNIVERSITY
-- going to UC Berkeley
Heng, Wee-Liang AA CM UC, BERKELEY
-- did not hear anything from
Kades, Eric NDS PSL YALE UNIVERSITY
-- going to CMU
Lent, Arthur MTC PSL MIT
-- staying at MIT
Siapas, Athanassios MTC AA MIT
-- staying at MIT
Slonim, Donna AA NDS YALE UNIVERSITY
-- going to UC-Berkeley
Spertus, Ellen DCS PSL MIT
-- staying at MIT
Stichnoth, James OS PSL UNIV OF ILLINOIS AT URBANA-CHAMPAIGN
-- going to CMU
Thornley, John PSL OS UNIVERSITY OF AUCKLAND (Same)
-- had said yes but changed mind at last minute. Plans now unknown.
Vo, Minh Tue AI ROB UNIVERSITY OF WATERLOO
-- going to CMU
Wallach, Deborah DCS NDS MIT
-- staying at MIT
Wvong, Russil AA NDS UNIVERSITY OF BRITISH COLUMBIA (Same)
-- working rather than graduate school
Yan, Thomas PSL CORNELL UNIVERSITY
-- staying at Cornell
∂02-May-90 1050 chandler@Sunburn.Stanford.EDU CSD RETREAT INFORMATION
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 10:50:18 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08288; Wed, 2 May 90 10:50:54 -0700
Date: Wed, 2 May 1990 10:50:54 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: retreatattendees1990@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: CSD RETREAT INFORMATION
Message-Id: <CMM.0.88.641670654.chandler@Sunburn.Stanford.EDU>
Following is the agenda for the CSD retreat, and a blurb telling all about
Chaminade at Santa Cruz. Please let me know if I can provide further
information about Chaminade or retreat plans.
Computer Science Department
1990 Faculty Retreat
Chaminade at Santa Cruz
1 Chaminade Lane
Santa Cruz, CA
Phone at Chaminade: 408-475-5600
All meetings in the Natural Bridges Room
Friday, May 4
Dinner 6:00-8:00 (New Brighton Room)
Evening Session: 8:00-9:30
Panel Discussion: "What's Right, What's Wrong
with the CSD? A Potpourri of Views"
Vivian Luo, CS Undergraduate
Don Geddis, PhD Student
Harvinder Singh, MS Student
Roy Jones, Lecturer
John Mitchell, Junior Faculty
Saturday, May 5
Breakfast served 7-9 in Main Dining Room
Morning Session A: 8:45-10:15
Vladimir Lifschitz, "Representing Action and
Change in Artificial Intelligence," and "Recent
Results on the Frame Problem"
Ed Feigenbaum, "Current research at the Heuristic
Programming Project, Knowledge Systems Laboratory"
Break (in Bay View Lounge)
Morning Session B: 10:45-12:00
John McCarthy, "Elephant"
Yoav Shoham, "Agent-Oriented
Programming"
Lunch (in Main Dining Room)
Afternoon Session A: 1:30-3:00
John Mitchell, "Linear Logic"
Rajeev Motwani, "Randomness and Algorithms"
Vaughan Pratt, "Concurrency via Geometry"
Break (in Bay View Lounge)
Afternoon Session B: 3:30-4:30
Tom Binford, Title to be announced
Monica Lam, "A Language for Coarse-Grain
Parallelism"
Free (Discussion and Volleyball)
Dinner 6:00-8:00 ( in Main Dining Room)
Evening Discussion 8:00--?
"The CSD Budget," Vaughan Pratt and
George Wheaton
"What would an intelligent building be
like?"
Sunday, May 6
Continental breakfast served 7-9 in Bay View Lounge
Morning Session A: 9:00-10:00
Eric Roberts on Computer Science
Education
Terry Winograd, "What Can We Teach About
Human-Computer Interaction?"
Break (in Bay View Lounge)
Morning Session B: 10:30-11:45
John Koza, "Genetically Breeding
Populations of Computer Programs to
Solve Problems"
Daniel Weise, "Overview of the FUSE
Project: Automatic Program
Transformation Using Partial Evaluation"
Brunch 12:00-1:00 (in Main Dining Room)
Adjourn 1:00
The Chaminade is located on a scenic, wooded 80-acre site on a high bluff
overlooking Monterey Bay. It is a full-service conference center which
provides lodging, meals and all facilities necessary on site for the CSD
Faculty Retreat. Accommodations have been made to your specifications.
Extensive recreational facilities are available (if you are an early riser
and/or we don't keep you too busy in sessions!), including a heated outdoor
swimming pool, spas, lighted tennis courts, two jogging/hiking trails through
the redwoods and along the crest of Chaminade's bluff, sports lawn for volley-
ball, badminton, etc. Bring your tennis racket, swim suit and/or jogging
shoes.
"California casual" type dress is encouraged. Evenings, particularly at this
time of year, can be cool. You will probably want to bring a sweater and/or
a light jacket.
I have maps in my office. If you would like one please stop by and pick one
up. To get to Chaminade take Highway 17 south to Santa Cruz, take Highway 1
South to the Watsonville/Monterey exit from Highway 17; continue on Highway 1
south, exiting on Soquel Avenue (first exit after Morrissey Boulevard); stay
right on exit to stop light. Turn right at light, crossing over Highway 1 to
first stop light. Turn left at signal and continue north 1/2 mile on Paul
Sweet Road to Chaminade Lane; follow Chaminade Lane as it curves to the left
through the Center's grounds to the main conference building for check-in.
You may check in at Chaminade any time after 4 PM on Friday, May 4. Simply
give your name to the Front Desk personnel at the main conference center
building; they will be expecting you and will provide you with your room
assignment and key.
Advance dinner reservations have been made for Saturday night.
If you have any questions, please do not hesitate to call me.
∂02-May-90 1238 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu Summary of rejects
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 12:38:52 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10900; Wed, 2 May 90 12:39:31 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA11567; Wed, 2 May 90 12:39:50 PDT
Date: Wed, 2 May 90 12:39:50 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9005021939.AA11567@coraki.stanford.edu>
To: phd-adm@cs.Stanford.EDU
Subject: Summary of rejects
Here's a breakdown of those who turned us down, organized by whether
they are staying or moving, and where they're going. MIT continues its
tradition of inbreeding, while CMU and Berkeley along with MIT continue
to show up as our strongest competition, with no clearcut strongest
competitor.
Interesting that we only lost one person to Princeton, I expected
Princeton to hurt us more than that.
MOVING:
Berkeley 3 (2 theory, 1 AI)
CMU 3 (2 systems, 1 AI)
Courant Inst. 1 (theory)
Cambridge 1 (AI)
MIT 1 (AI)
Princeton 1 (theory)
STAYING PUT:
MIT 4 (2 theory, 2 systems)
Cornell 1 (PSL)
EMPLOYED: 1
PLANS UNKNOWN: 4
∂02-May-90 1331 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: Summary of rejects
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 13:31:17 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12036; Wed, 2 May 90 13:31:54 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA11806; Wed, 2 May 90 13:29:44 -0700
Date: Wed, 2 May 1990 13:29:44 PDT
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: Vaughan Pratt <pratt@cs.Stanford.EDU>
Cc: phd-adm@cs.Stanford.EDU
Subject: Re: Summary of rejects
In-Reply-To: Your message of Wed, 2 May 90 12:39:50 PDT
Message-Id: <CMM.0.88.641680184.ango@Hudson.Stanford.EDU>
I am somewhat concerned by the fact that we lost the best students, most of
them to Berkeley (which is surprising).
Combined with my impression that the current admissions process
does not end up with the "right" group of students, this is becomes
more serious.
How do you feel about the effectiveness of our admissions and recruiting?
--Andrew
∂02-May-90 1353 @Sunburn.Stanford.EDU:dill@hohum.Stanford.EDU recruitment
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 13:53:28 PDT
Received: from hohum.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12820; Wed, 2 May 90 13:54:07 -0700
Received: by hohum.Stanford.EDU (5.57/Ultrix3.0-C)
id AA24890; Wed, 2 May 90 13:52:14 EDT
Date: Wed, 2 May 90 13:52:14 EDT
From: dill@hohum.Stanford.EDU (David Dill)
Message-Id: <9005021752.AA24890@hohum.Stanford.EDU>
To: phd-adm@cs.Stanford.EDU
Subject: recruitment
I don't see any BIG problems with admissions. However, I can
think of three things that might make a difference:
1. Completing the process earlier.
2. Early admits
3. Procedures in the final meeting.
I don't really know the issues in point (1), but I remember
from what Sharon said that it's hard to do. Hard doesn't
mean impossible, though. (2) I know that several people
(including MRG who obviously has more experience than I do
with this) felt that it doesn't make a difference. Do we
have any way of gathering more information on this question?
The previous two points relate to our ability to get people
to come here. Point 3 relates to whether we are accepting
the right people. After participating in the final meeting
this year, I think it would have run more smoothly had we
kept to the following simple and rigid procedure:
1) Decide how many we want to admit.
2) Pick that many according to the rankings.
(including white-ball candidates)
3) Only then consider changing the list. To change the list,
someone would have to make an argument that person Y (not
on admit list) should replace person X (on the list), and
we would have to vote on that basis.
I think we didn't do a fantastic job on the bottom 10 cases
this time, because it was hard to make clear comparisons
(and because of time pressure).
I have no idea how well our recruitment processes are working because
I really have no idea what they were. I know that some of my
colleagues in CSL were in contact with admittees, but I was not asked
to talk to any (I would have been happy to do so). I know that one of
the points raised in one of the admissions committee was a plan to
have a party for visiting admittees. Did this happen? In general, I
am amazed that there is no faculty involvement in the recruitment
committee here. It seems to me that the people on the admissions
committee should also be involved in recruitment.
It seems to me, however, that the people I really remember
from the admissions committee who didn't come here mostly
stayed where they were (Yan, Wallich, and Arora, in
particular). There seem to be a number of good systems
students. What efforts were made to recruit theory students.
∂02-May-90 1355 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Summary of rejects
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 13:55:32 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12863; Wed, 2 May 90 13:56:06 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA11971; Wed, 2 May 90 13:56:22 PDT
Message-Id: <9005022056.AA11971@coraki.stanford.edu>
To: "Andrew V. Goldberg" <ango@hudson.stanford.edu>
Cc: phd-adm@cs.stanford.edu, pratt@coraki.stanford.edu
Subject: Re: Summary of rejects
In-Reply-To: Your message of Wed, 2 May 1990 13:29:44 PDT.
<CMM.0.88.641680184.ango@Hudson.Stanford.EDU>
Date: 02 May 90 13:56:21 PDT (Wed)
From: pratt@cs.Stanford.EDU
I am somewhat concerned by the fact that we lost the best
students, most of them to Berkeley (which is surprising).
Could you quantify this? I'd like to see something like a string of
1's and 0's (1 for accept), listed in the order of our final ranking of
students, before I'd make any further comments.
-v
∂02-May-90 1424 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu Re: Summary of rejects
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 14:24:22 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13626; Wed, 2 May 90 14:24:39 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA12168; Wed, 2 May 90 14:24:58 PDT
Message-Id: <9005022124.AA12168@coraki.stanford.edu>
To: phd-adm@cs.stanford.edu
Subject: Re: Summary of rejects
In-Reply-To: Your message of Wed, 2 May 1990 13:29:44 PDT.
<CMM.0.88.641680184.ango@Hudson.Stanford.EDU>
Date: 02 May 90 14:24:57 PDT (Wed)
From: pratt@cs.Stanford.EDU
Now that I think of it, statistics predicts the phenomenon Andrew is
observing, and that I asked for evidence of. This phenomenon should
happen even if Stanford is three times as good as its nearest
competitor (which we all well know to be an understatement
characteristic of our modesty and low profile).
As bookmakers will tell you, better horses get better odds, not because
they're more likely to win but because better horses mean more
bettors. Bookies can afford long odds on long shots because only the
occasional schmuck, super optimist, or deep insider, bets on weak
horses. When a bookie finds himself in deep with a long shot as a
result of taking many or big bets with it, no matter how low his
opinion of the horse a responsible bookie who loves his family will
spread the risk around by betting on that horse with several fellow
bookies. In Australia, and maybe here, I think this is called
something like laying off the odds. The art of sound bookmaking is
decided before the race in the competition between bettors for horses,
not during the race in the competition between the horses themselves.
Thus we must expect a greater density of accepts from among the low end
of our list, corresponding to fewer bettors (here schools) betting on
individuals from that end.
This reasoning is based on the premise that there is more agreement
between schools on who to put at the top of the list than at the
bottom. I am certain this true, in part because there is no threshold
associated with the top, unlike the bottom, and hence no decision to be
made about the top people, and in part because "the higher you go the
fewer" and conversely the lower you go the more candidates you have to
pick a small subset of.
EVERY school should observe this phenomenon. And every school except
Stanford should feel bad about it. Stanford needn't feel bad about it
because only at Stanford are people smart enough to recognize it as
just a necessary quirk of statistics, not a reflection on Stanford.
I've never bet on a horse, but maybe one day...
-v
∂02-May-90 1433 @Sunburn.Stanford.EDU:jcm@Iswim.Stanford.EDU Re: Summary of rejects
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 14:33:41 PDT
Received: from iswim.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13940; Wed, 2 May 90 14:34:18 -0700
Received: from LOCALHOST by Iswim.Stanford.EDU with SMTP (5.61/25-eef) id AA01516; Wed, 2 May 90 14:35:12 -0700
Message-Id: <9005022135.AA01516@Iswim.Stanford.EDU>
To: pratt@cs.Stanford.EDU
Cc: phd-adm@cs.stanford.edu
Subject: Re: Summary of rejects
In-Reply-To: Your message of Wed, 02 May 90 14:24:57 -0700.
<9005022124.AA12168@coraki.stanford.edu>
From: John C. Mitchell <jcm@cs.Stanford.EDU>
Reply-To: John C. Mitchell <jcm@cs.Stanford.EDU>
Date: Wed, 02 May 90 14:35:11 -0700
Sender: jcm@Iswim.Stanford.EDU
This is a great argument. It ought to be saved somewhere.
∂02-May-90 1435 pratt@coraki.stanford.edu lunch tomorrow?
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 14:35:33 PDT
Received: from coraki.stanford.edu by sierra.Stanford.EDU (4.1/4.7); Wed, 2 May 90 14:33:38 PDT
Received: by coraki.stanford.edu (4.0/25-eef) id AA12211; Wed, 2 May 90 14:34:28 PDT
Date: Wed, 2 May 90 14:34:28 PDT
From: Vaughan Pratt <pratt@cs.stanford.edu>
Message-Id: <9005022134.AA12211@coraki.stanford.edu>
To: ee-faculty@sierra, faculty@cs
Subject: lunch tomorrow?
I'll be taking Marc Levoy to lunch at the faculty club tomorrow,
leaving from MJH around 12:30. If you'd like to join us please let me
know.
-v
∂02-May-90 1459 @Sunburn.Stanford.EDU:ango@Hudson.Stanford.EDU Re: recruitment
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 14:59:24 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14686; Wed, 2 May 90 15:00:04 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA12253; Wed, 2 May 90 14:57:56 -0700
Date: Wed, 2 May 1990 14:57:55 PDT
From: "Andrew V. Goldberg" <ango@Hudson.Stanford.EDU>
To: dill@hohum.Stanford.EDU (David Dill)
Cc: phd-adm@cs.Stanford.EDU
Subject: Re: recruitment
In-Reply-To: Your message of Wed, 2 May 90 13:52:14 EDT
Message-Id: <CMM.0.88.641685475.ango@Hudson.Stanford.EDU>
I am sorry that I confused "r" and "R" and send the message to a wider
group, and the result was that it was read out of context.
All I ment to say was that the two theory students I was most impressed
with went to Berkeley. Reverse holds for the bottom of my preference list.
(I guess Vaughan would say that we made a bet on a gray horse.)
I am talking here about admits with interests in AA/MTC only.
We did have a great success rate with students from India.
I did not mean to open this particular can of worms; my finger just slipped.
--Andrew
∂02-May-90 1602 ingrid@russell.Stanford.EDU CSLI Calendar, 3 May, vol 5:26
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 16:02:52 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA25310; Wed, 2 May 90 14:53:33 PDT
Date: Wed, 2 May 90 14:53:33 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005022153.AA25310@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 3 May, vol 5:26
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
3 May 1990 Stanford Vol. 5, No. 26
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 3 MAY 1990
12:00 noon TINLunch
Cordura 100 Fuzzy Logic and its Applications
Lotfi A. Zadeh
Computer Science Division
University of California, Berkeley
(zadeh@ucbarpa.berkeley.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 3
led by Stanley Peters
(peters@csli.stanford.edu)
Abstract below
4:15 p.m. CSLI Colloquium
Cordura 100 Metaphor Comprehension by Neural Networks
Kouichi Doi
Department of Electrical Engineering
University of Tokyo
(doi@mtl.t.u-tokyo.ac.jp)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 10 MAY 1990
12:00 noon TINLunch
Cordura 100 Logical Consequence and Model-Theoretic
Consequence, I: Etchemendy's Critique of the
Tarskian Analysis
Greg O'Hair
Visiting Scholar from The Flinders University
of South Australia
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 4
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Derivation vs. Constraints in Syntax
Speakers: Joan Bresnan, Ivan Sag, Peter Sells
(bresnan@csli.stanford.edu, sag@csli.stanford.edu,
sells@csli.stanford.edu)
Abstract below
____________
THIS WEEK'S SEMINAR
Controversies in Natural-Language Research 3
led by Stanley Peters
At this week's seminar, Ron Kaplan, Lauri Karttunen, Martin
Kay, Paul Kiparsky, and Bill Poser will discuss the following two
questions, among others raised by the previous two seminars.
(1) Finite-state algorithms for morpho-phonological analysis are very
successful in performing rapid analysis of a large class of words
using limited memory. If they are essentially connected with
Chomsky and Halle's SPE framework, how can they be successful over
so broad a range of phenomena and languages?
(2) Templatic morphology and autosegmental phonology are very
successful in expressing the generalizations that characterize the
inventory of words of various languages, more so than the SPE
framework. Speaker-hearers can apparently analyze virtually any
word of their language quickly using little short-term memory.
How can such a computationally efficient algorithm exist for each
language characterizable by these theories?
____________
NEXT WEEK'S TINLUNCH
Logical Consequence and Model-Theoretic Consequence, I:
Etchemendy's Critique of the Tarskian Analysis
Greg O'Hair
This is the first of two talks about John Etchemendy's new book, _The
Concept of Logical Consequence_ (Harvard, 1990).
It is widely assumed that Tarski's model-theoretic account of logical
truth and logical consequence captures the corresponding intuitive
notions.
Etchemendy argues, I believe soundly, that this is not so: The
Tarskian analysis lacks theoretical or conceptual justification and is
not in general extensionally adequate. In this talk, I examine his
arguments.
____________
NEXT WEEK'S CSLI SEMINAR
Controversies in Natural-Language Research 4
Derivation vs. Constraints in Syntax
Joan Bresnan, Ivan Sag, Peter Sells
The most widespread conception of syntactic levels is the derivational
one, which characterizes both Government-Binding Theory and Relational
Grammar, but not the constraint-based theories being developed here at
Stanford. We will focus on some issues that can differentiate the two
conceptions. Each week, all of the participants will briefly present
alternative views within a specified domain, and discuss them.
Next week, 10 May, we will look at the data analyzed within
Government-Binding Theory by verb-movement, concentrating on the
implications of this for generalizations about constituent order, and
the syntax/morphology relationship, and considering other ways of
accounting for the relevant variation.
The following week, 17 May, we will address the issue of how to
characterize the various levels of structure needed in syntax: Should
there be uniformity across levels, as in RG and GB? Should the
underlying levels of structure of UG be characterized in the formal
categorial structure of familiar standard European languages (INFL,
VP, etc.), as in GB? And generally, how abstract is/are underlying
levels of syntactic representation?
The week after that, 24 May, we will have a "panel discussion" of
issues arising out of the previous weeks' presentations.
____________
SYMBOLIC SYSTEMS FORUM
The Neurophysiology of Conscious Experience
Ben Libet
Department of Physiology
University of California, San Francisco
Thursday, 3 May, 4:15 p.m.
Building 60, Room 61G
The special requirements for cerebral activity to elicit a conscious
subjective experience have been experimentally addressed, with
intracranial studies in human subjects. How the brain distinguishes
conscious from unconscious mental functions was also investigated.
The findings and their implications will be presented and discussed.
Next week, 10 May: The Problem of Idle Time, B. A. Huberman, Xerox
Palo Alto Research Center.
____________
LANGUAGE ACQUISITION INTEREST GROUP
Catherine Nichols
Friday, 4 May, 12:00 noon
Building 100, Greenberg Room
Catherine Nichols, a postdoctoral fellow in Psychology, will present
her dissertation in this workshop.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
The Rationality and Objectivity of Scientific Inference
John Earman
University of Pittsburgh
Friday, 4 May, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Verb Agreement in Hindi
Tara Mohanan
(tara@csli.stanford.edu)
Friday, 4 May, 3:30 p.m.
Cordura 100
The verb in Hindi agrees with its nominative subject. If the subject
is nonnominative, the verb agrees with its nominative object. If the
object is also nonnominative, the verb is in the neutral or
nonagreeing form (third person masculine singular). The
verb-agreement principle can be stated as: the verb agrees with its
highest nominative argument.
Hindi has an incorporation construction in which an uninflected object
or locative nominal forms a lexical compound with the verb. Yet, when
the subject is not nominative, the verb agrees with this noun if it is
nominative. Thus, a verb agrees with a noun inside the verb compound.
This situation raises questions about the notion "lexical." A
related problem appears in the construction involving complex
predicates made up of a nominal host and a light verb: if the subject
is nonnominative, the light verb can agree with its host. Given that
the light verb and the nominal host together form the predicate of the
clause, this amounts to saying that the predicate agrees with an
entity internal to the predicate. In both these constructions, an
entity that is part of the predicate must at the same time be an
independent argument, so that it can control verb agreement, thus
creating an apparent contradiction.
In this talk, I will provide an analysis of agreement in the
incorporation and complex predicate constructions that yields a
solution to this apparent contradiction, in terms of a theory that
factors apart the representation of argument structure and grammatical
category structure, and allows for mismatches between the structures.
The notion "lexical item" may be expressed either as "categorial
word," which is a word-like unit in category structure, or as
"functional word," which is a word-like unit in argument structure
(and grammatical function structure). These two notions need not
always coincide. Thus, a categorial word may correspond to more than
one functional word, and a functional word may correspond to more than
one categorial word. This analysis derives from a conception in which
morpho-syntactically relevant semantic information, valency
information, grammatical function information, and grammatical
category information are factored apart into four copresent levels of
structure, simultaneously accessible to principles of grammar.
____________
PHONOLOGY WORKSHOP
Jared Bernstein
SRI International
(jar@speech.sri.com)
Tuesday, 8 May, 7:30 p.m.
Ventura 17
No abstract available.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Some Cognitive Aspects of Individual Differences
in Attachment Organization
Mary Main
University of California, Berkeley
Wednesday, 9 May, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
∂02-May-90 2113 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ACM Elections
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 21:12:59 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AB21601; Wed, 2 May 90 21:12:57 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22111; Wed, 2 May 90 21:12:17 -0700
Message-Id: <9005030412.AA22111@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4443; Wed, 02 May 90 23:10:49 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4316; Wed, 02 May 90 23:10:45 CDT
Date: Wed, 2 May 90 13:45:33 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: dsj%research.att.com@VM1.NoDak.EDU
Subject: ACM Elections
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
MESSAGE TO ALL THEORYNET READERS WHO BELONG TO ACM
You have no doubt already received a ballot for the 1990 ACM general
election. This is an important election, with significant
differences between the candidates, especially with respect to their
attitude towards the more scientific side of ACM, and toward the
"Special Interest Groups" such as SIGACT.
If you haven't done so already, please read the biographical data
and personal statements for the candidates with care, and VOTE.
It will only take a few minutes and a 25 cent stamp, but it can make
a major difference.
David Johnson, SIGACT Chair
∂02-May-90 2206 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU address wanted
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 May 90 22:06:16 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA23671; Wed, 2 May 90 22:06:43 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22346; Wed, 2 May 90 22:06:11 -0700
Message-Id: <9005030506.AA22346@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3951; Thu, 03 May 90 00:03:11 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3628; Thu, 03 May 90 00:01:44 CDT
Date: Wed, 2 May 90 13:55:28 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Mandayam A. Srinivas" <SRINI%CALSTATE.watson.ibm.com@VM1.NoDak.EDU>
Subject: address wanted
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Could someone please send me (srini@calstate.bitnet)
the full postal address and/or the phone number of:
Jerrold R. Griggs
University of South Carolina
Your help will be much appreciated.
Mandayam A. Srinivas
Computer Science Department
California State Polytechnic University, Pomona
∂03-May-90 0751 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Is o(m n↑3) known for regexp size m matching string size n?
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 07:51:11 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22304; Thu, 3 May 90 07:51:22 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25785; Thu, 3 May 90 07:50:46 -0700
Message-Id: <9005031450.AA25785@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1106; Thu, 03 May 90 09:14:24 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
0945; Thu, 03 May 90 09:12:14 CDT
Date: Wed, 2 May 90 13:56:21 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Dan Bernstein <brnstnd%princeton.edu@VM1.NoDak.EDU>
Subject: Is o(m n↑3) known for regexp size m matching string size n?
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Given a regular expression of size m and a string of length n, is the
problem of determining whether the regexp matches the string known to be
faster than m n↑3? In particular, is it known to be O(m n↑2.522)?
Here by a ``regular expression'' I mean an expression built up from the
following: c, any expression that can be tested against a single symbol
in constant time and will never match strings of length other than 1;
pq, the concatenation of p and q; p|q, either p or q; ↑p, which matches
iff p doesn't; and p*, the transitive closure of p, equal to 1|p(p*).
---Dan
∂03-May-90 0751 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Wanted: Algorithms for sorting posets
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 07:51:35 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22306; Thu, 3 May 90 07:51:33 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25788; Thu, 3 May 90 07:51:19 -0700
Message-Id: <9005031451.AA25788@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1943; Thu, 03 May 90 09:16:04 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1796; Thu, 03 May 90 09:12:52 CDT
Date: Wed, 2 May 90 13:56:44 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Gerard Ellis <ged%batserver.cs.uq.oz.au@VM1.NoDak.EDU>
Subject: Wanted: Algorithms for sorting posets
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am looking for any algorithms for sorting posets.
I recently managed to dig up the following paper:
Atkinson, M. D. (1988) Partially Ordered Sets and Sorting, Computers in
Mathematical Research, Institute of Mathematics and Its Applications
Conference Series, Proc. of a Conference, Cardiff 1986.
I was wondering if there are more recent results.
Cheers, Gerard.
email: ged@batserver.cs.uq.oz.au (overseas)
ged@batserver.cs.uq.oz (within Australia)
Gerard Ellis
Key Centre for Information Technology
University of Queensland, Qld, 4072
Australia
∂03-May-90 0943 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU UNISYS Fellowship Opportunity: Area: Exploitation of Very Large
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 09:43:39 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28528; Thu, 3 May 90 09:41:20 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA16579; Thu, 3 May 90 09:39:12 -0700
Date: Thu, 3 May 1990 9:39:10 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: phd@cs.Stanford.EDU, faculty@cs.Stanford.EDU
Subject: UNISYS Fellowship Opportunity: Area: Exploitation of Very Large
Memories; Deadline: May 29 a.m.
Message-Id: <CMM.0.88.641752750.tajnai@Hudson.Stanford.EDU>
I have confirmed that the following Unisys Fellowship Proposal should be
handled through me; it will not carry overhead. Note the deadline:
Monday, May 28, is s holiday. Therefore, the completed applications
must be submitted to me by Tuesday, May 29, IN THE MORNING. They will
have to be fedexed to Unisys that afternoon.
"Unisys wishes to sponsor doctoral-level research into the use of very
large memories. Attached is the description of the research.
"We are soliciting proposals from approximately 15 Universities,
with the expectation of funding one or two fellowships from the combined
response. We would like you to consider sponsoring such a proposal.
"EXPECTATIONS:
"This is our division's first experience in recent history in directly
funded research. While many details can be determined later in the
selection process, I would like to discuss here some of the
assumptions we have made:
"The fellowship is for one year, with the expectation of renewing it
for a total of 2 or 3 years (depending on the nature of the
proposal)
"The financial sponsorship will consist of 3 components:
a direct stipend to the researcher, of $1,050 per
month during the research period.
payment of the researcher's tuition and fees during the
research period.
a direct unrestricted donation to the researcher's
department of $10,000, paid half in '90, half in '91.
"Since tuition & fees vary, their amount must be identified
and included with the proposal.
"Any Unisys equipment provided for the duration of the research
will include Unisys-paid product support.
"PROCESS:
"Proposals are due at 4 p.m. CDT May 30, 1990.
A "short list" of the better proposals will be determined by June 8, 1990;
and all submitters will be notified of their status on that date.
"The candidate researchers on the short list will be invited to come in June
to Roseville, MN, at Unisys expense, to meet with us and to present their
proposal in person.
"Final selection(s) will be made by July 11, 1990.
"We assume the research activity would begin with the start of the 90-91
school year, but this starting point may be moved by mutual agreement.
UNISYS SPONSORED RESEARCH:
EXPLOITATION OF VERY LARGE MEMORIES
"The trends in semiconductor memory have led to computer systems with
real processor memories of a gigabyte or more, with continued growth
likely. This includes very large application program data and
instruction spaces. There are relatively obvious ways to put memory
of this size to use, such as enlarging the number of tasks
multiprocessed, employing virtual memory, and increasing the memory
used to buffer I/O activity. However, it seems likely that this is
just scratching the surface. These very large memory systems may be
of a character as different from today's mainframes as today's
mainframes are from the 32k word "big systems" of 20 years ago. New
applications, new systems approaches, new design approaches, even new
programming habits may be needed to take advantage of very large
memories.
"Unisys will sponsor a fellowship to promote research to better
exploit very large memory systems. Possible topic area might include:
operating system modifications, tools such as compilers and CASE
systems, new applications, approaches to reversing long-entrained
biases in designers and programmers. Note that the research will not
be about the design of the memory or about how to design or
manufacture systems with large memory -- it will be about ways of
putting the memory to use.
"The value of the fellowship is the cost of tuition and fees, plus a
stipend of $1,050 per month for 12 months during the 90-91 school
year. If required by the proposed research, Unisys will provide a 386
PC and/or remote access to very large memory Unisys systems.
"To propose research, submit:
a short (1 to 5 page) description of the proposed research,
the credentials/background of the researcher,
the name/position/phone number of the faculty sponsor,
the amount of the tuition and fees for the research period.
"Submit to:
Unisys Large Memory Fellowship
Attn: David Dunshee, mail station WE3C
2276 Highcrest Road
P. O. Box 64942
St. Paul, MN 55164"
∂03-May-90 0944 shankle@sierra.Stanford.EDU RA APPOINTMENT FORMS 90/91
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 09:44:31 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Thu, 3 May 90 09:41:53 PDT
Date: Thu, 3 May 90 09:41:53 PDT
From: shankle@sierra.Stanford.EDU (Diane J. Shankle)
To: EE-faculty@sierra.Stanford.EDU
Cc: EE-adminlist@sierra.Stanford.EDU
Subject: RA APPOINTMENT FORMS 90/91
Message-Id: <CMM.0.88.641752908.shankle@>
Just to let you know all RA appointment forms for Summer are due in the
office now.
We have just received the new RA Appointment Forms, Rate Sheets and
Financial Forms. Please drop by McC 164 and pick up the forms that will
be sitting outside the door on a table. Autumn Quarter forms are due in
by July 1st to avoid confusion with tuition.
Enjoy the beautiful weather!
Thanks,
Diane
∂03-May-90 1152 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU turing machines and graph theory
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 11:51:50 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06630; Thu, 3 May 90 11:52:12 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01714; Thu, 3 May 90 11:51:37 -0700
Message-Id: <9005031851.AA01714@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8237; Thu, 03 May 90 13:48:41 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8138; Thu, 03 May 90 13:48:37 CDT
Date: Wed, 2 May 90 13:57:01 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Jonathan Rowe <jro%expya.cs.exeter.ac.uk@VM1.NoDak.EDU>
Subject: turing machines and graph theory
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
This is a half-baked idea I had and was wondering if anyone new of any related
work/ideas. Suppose we have a turing machine M for some function f.
Considering the state network as a digraph G(M) what can be said about the
functions represented by subgraphs of G(M) ? Conversely, given several such
turing machines M1,...,Mn representing functions f1,...,fn is there a digraph
of which G(M1),...,G(Mn) are subgraphs that is in some sense minimal for these
subgraphs (e.g. it is the smallest such digraph) and, if so, can a turing
machine M' be based on it implementing a function f'? Further, what is the
relation of f' to f1,...,fn?
All this needs tidying up a lot, I guess, e.g. to include information about
labels of states and arcs etc. Any ideas/comments?
Jon.
∂03-May-90 1154 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU turing machines and graph theory
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 11:53:55 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA06693; Thu, 3 May 90 11:54:06 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01732; Thu, 3 May 90 11:52:09 -0700
Message-Id: <9005031852.AA01732@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9054; Thu, 03 May 90 13:49:17 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
8872; Thu, 03 May 90 13:49:11 CDT
Date: Wed, 2 May 90 13:57:33 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Jonathan Rowe <jro%expya.cs.exeter.ac.uk@VM1.NoDak.EDU>
Subject: turing machines and graph theory
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Here are some further thoughts on sub-graphs of turing machines. Take, as an
example, the following tm for adding two numbers. Input is expected of the
form:
...0000<11....1+11...1>0000........
↑
where 0 is a blank symbol, < is start of input, > the end of input, and +
seperates the two numbers represented by strings of 1's. The read/write
head is on the < symbol. The tm will basically work by deleting the + and
moving the second string up to the first. The initial state is A.
STATE READ WRITE MOVE NEW STATE
A < or 1 right A
+ # right B
B 1 # left C
> 0 left E
C # 1 right D
D # right B
E # > finish
The graph looks something like this:
--- <---
--> | A | |
--- ----
| ------------<-------------
V | |
--- --- --- |
| B | ---> | C | ---> | D | ---
--- --- ---
|
V
---
| E |
---
|
V
Now some of the subgraphs of this seem to represent useful turing machines.
E.g. State A by itself is a method of moving right though a tape until a
certain symbol is encountered. The B, C, D loop is a method of shuffling
strings of symbols to the left and E is a general finishing state. It seems to
me that these pieces of turing machines would be used frequently in building
up bigger ones, maybe in the way that the functions are defined in terms of
other functions. Is there some way in which these "primitive" tm parts can be
glued together to form bigger tms? It would be a kind of structured
programming with turing machine parts.
Jon.
∂03-May-90 1158 @Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Computing convolutions
Received: from Neon.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 11:58:05 PDT
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA07166; Thu, 3 May 90 11:58:25 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01855; Thu, 3 May 90 11:57:47 -0700
Message-Id: <9005031857.AA01855@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9827; Thu, 03 May 90 13:53:19 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
9598; Thu, 03 May 90 13:50:00 CDT
Date: Wed, 2 May 90 13:57:47 -0400
Reply-To: theorynet-request%ibm.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Dan Gordon <helios!gordon%tut.cis.ohio-state.edu@VM1.NoDak.EDU>
Subject: Computing convolutions
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Most books on algorithm design and analysis carry a chapter on the
FFT. One of the uses of the FFT is to compute convolutions of two
vectors of size n in O(nlogn) time. Is anyone out there familiar
with techniques that do NOT use the FFT? In particular, are there
other ways to compute convolutions in the same time without FFT?
References will be greatly appreciated. Please use email
(gordon@cssun.tamu.edu).
Many thanks in advance, Dan Gordon.
∂03-May-90 1304 @Sunburn.Stanford.EDU:kar@Neon.Stanford.EDU Admission results
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 13:03:58 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03468; Thu, 3 May 90 13:04:16 -0700
Received: from LOCALHOST by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA11851; Thu, 3 May 90 13:04:11 -0700
Message-Id: <9005032004.AA11851@Neon.Stanford.EDU>
To: phd-adm@cs.stanford.edu
Subject: Admission results
In-Reply-To: Your message of Wed, 02 May 90 14:24:57 -0700.
<9005022124.AA12168@coraki.stanford.edu>
Date: Thu, 03 May 90 13:04:09 -0700
From: kar@Neon.Stanford.EDU
I've looked through our admissions rating sheet, and come up with the
following statistics for the 23 out of 43 admittees who appear on the list.
Rank Accept
1-5 *
6-10 ***
11-15 **
16-20 ***
21-25 ***
26-30 **
31-35 ***
36-40 ****
41-43 **
If the top eight had been early admits, then we would have got 2 of them.
As convincingly argued by Vaughan, we should expect more competition at the
high end of our ranking.
I don't think we did too badly, looking at these results. There was broad
agreement on admitting the top 35 or so, and our acceptance pattern seems
fairly uniform in that range.
In each subarea, using Vaughan's binary system, the results (according to
the first listed area of interest) were
MTC 001010 2/6
AA 0011001 3/7
CL 0111 3/4
AI 0101110011 6/10
PSL 0110 2/4
DCS 11000 2/5
CG 11 2/2
NDS 1101 3/4
OS 0 0/1
Of the total of 25 (including the deferrals, white-balls etc.) 12 are from
foreign undergrad schools, 13 from US schools. So thats 12/17 foreign and
13/28 local.
One interesting statistic is the binary representation of MIT undergrads
accepting.
MIT 000010011 3/9
Ken.
∂03-May-90 1332 chandler@Sunburn.Stanford.EDU Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 13:32:16 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04742; Thu, 3 May 90 13:32:27 -0700
Date: Thu, 3 May 1990 13:32:27 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: tenured@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Faculty Meeting
Message-Id: <CMM.0.88.641766747.chandler@Sunburn.Stanford.EDU>
There will be a meeting of the senior faculty at 2:30 next Tuesday, May 8 in
MJH-146 to consider two faculty candidates being proposed by the Scientific
Computing and Computational Mathematics search committee. Relevant vitas and
recommendation letters will be in my office for your inspection. PLEASE COME
BY AND TAKE A LOOK AT THEM. Thanks.
∂03-May-90 1415 chandler@Sunburn.Stanford.EDU 5/1 General Faculty Meeting Vote
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 14:15:05 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08319; Thu, 3 May 90 14:15:55 -0700
Date: Thu, 3 May 1990 14:15:54 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: bigelow@cs.Stanford.EDU, binford@cs.Stanford.EDU, cheriton@cs.Stanford.EDU,
guibas@cs.Stanford.EDU, hennessy@cs.Stanford.EDU,
knuth@cs.Stanford.EDU, latombe@cs.Stanford.EDU, manna@cs.Stanford.EDU,
jmc-lists@sail.Stanford.EDU, mccluskey@cs.Stanford.EDU,
motwani@cs.Stanford.EDU, wiederhold@cs.Stanford.EDU,
weise@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, winkler@cs.Stanford.EDU
Subject: 5/1 General Faculty Meeting Vote
Message-Id: <CMM.0.88.641769354.chandler@Sunburn.Stanford.EDU>
A vote was taken at the May 1 general faculty meeting to appoint Brian N.
Bershad and Marc Lavoy Assistant Professors in the Computer Science
Department. The vote of the faculty which were present was unanimous in
favor of making these appointments. Please let me know what you vote is on
both of these candidates.
∂03-May-90 1506 gerlach@sierra.Stanford.EDU Commencement
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 15:06:46 PDT
Received: by sierra.Stanford.EDU (4.1/4.7); Thu, 3 May 90 15:05:20 PDT
Date: Thu, 3 May 90 15:05:20 PDT
From: gerlach@sierra.Stanford.EDU (Sharon Gerlach)
To: ee-faculty@sierra.Stanford.EDU
Cc: gerlach@sierra.Stanford.EDU
Subject: Commencement
Message-Id: <CMM.0.88.641772319.gerlach@>
Greetings,
The Dept has been requested to provide Marshals for the University
Graduation ceremony at the Stadium, and so we are seeking volunteers who are
planning to participate in the events Commencement day.
Last year we were fortunate to have two EE faculty, Giovanni DeMicheli and
Simon Wong, represent the Dept as Marshals at the Stadium. We are hoping for
a similar response this year -- unfortunately we need to respond rather
quickly and would very much appreciate hearing from you as soon as possible.
Thanks!
Sharon
∂03-May-90 1814 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU parking
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 May 90 18:14:04 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16734; Thu, 3 May 90 17:59:12 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA21269; Thu, 3 May 90 17:57:44 PDT
Date: Thu, 3 May 90 17:57:44 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9005040057.AA21269@Tenaya.Stanford.EDU>
To: csd-list@cs.stanford.edu
Subject: parking
I think this note may be of interest to several people:
----
Begin forwarded message:
Date: Thu, 3 May 90 10:55:45 PDT
To: nilsson@sierra.stanford.edu
From: "Ken Down" <HF.KSD@forsythe.stanford.edu>
Subject: Special Hearing of the Committee on Parking and Transportation
16:39:17 05/02/90 FROM HK.JPF "Julia Fremon": Public hearing announcement
TO OUR FRIENDS IN THE SCHOOL OF ENGINEERING:
At the request of your colleagues, and with the special
assistance of Ken Down, the Committee on Parking and
Transportation (CPT) will be holding an extra public hearing
on its proposals for parking and transportation policies
for the 1990's.
The hearing will be:
Thursday, May 10
Terman Auditorium
12 noon - 1 p.m.
The purpose of the meeting is to hear community reactions
to the committee's draft recommendations, before
finalizing its report to Presdent Kennedy. We have already
received a good number of written comments from Engineering
School folks, and the committee members have read them all.
At the meeting, we hope to hear further thoughts, and to have
a chance for follow-up discussion of some of your ideas.
Most useful of all will be alternative proposals, if you
think the ones we've put forward wouldn't be workable or
fair. We're all engaged in a community effort to allocate
finite resources, and we need creative ideas.
- Julia Fremon, Transportation Programs
Staff to the CPT
PS I have copies of the Committee proposals if you would like
to review them again. Please request from the information
desk on the second floor of Terman, Room 202.
Ken Down
To:
CHAIRS(CANNON@SIERRA,GOODMAN@SIERRA,HAGSTROM@SIERRA,HA
USMAN@SIERRA,
HOMSY@SIERRA,IGLEHART@SIERRA,LUENBERGER@SIERRA,NILSSO
N@SIERRA,
REYNOLDS@SIERRA,SHAH@SIERRA),
DEPTCONT(CARILLI@SIERRA,DIETRICH@SIERRA,
DISKIN@KRAKATOA,GERLACH@SIERRA,HF.GLS,HF.JJC,HF.RRK,HF.SM
S,JC.PAB,
NJ.DMS,NK.NMF,PETERSON@SIERRA,WHEATON@POLYA),
RESADM(AS.KCC,AS.KWM,
HF.GDR,HF.KXM,HF.RAD,HF.RRK,NA.BJS,NA.PLP,NA.SEW,NA.XFG)
cc: GIBBONS@SIERRA, CARLSTEAD@SIERRA
∂04-May-90 0905 chandler@Sunburn.Stanford.EDU More retreat.....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 09:04:59 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA24842; Fri, 4 May 90 09:05:43 -0700
Date: Fri, 4 May 1990 9:05:43 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: retreatattendees1990@Sunburn.Stanford.EDU
Subject: More retreat.....
Message-Id: <CMM.0.88.641837143.chandler@Sunburn.Stanford.EDU>
Before you go off to Chaminade I just wanted to be sure you are all aware of
how the billing will work. The Department is picking up the expenses for the
rooms and meals (some of which will include wine). You should be sure to pay
for all other expenses upon checkout, such as telephone charges, room service
charges, etc. Let me know if you have any last minute questions.
∂04-May-90 1003 @Sunburn.Stanford.EDU:ejm@shasta.Stanford.EDU re: Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 10:00:57 PDT
Received: from shasta.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26155; Fri, 4 May 90 09:43:50 -0700
Received: by shasta.Stanford.EDU (5.57/4.7); Fri, 4 May 90 09:34:34 PDT
Date: Fri, 4 May 1990 9:34:33 PDT
From: Ed McCluskey <ejm@shasta.Stanford.EDU>
To: Robert W Floyd <RWF@SAIL.Stanford.EDU>
Cc: MPS@SAIL.Stanford.EDU, csdlist@CS.STANFORD.EDU
Subject: re: Bulletin Boards and First Aid Kits
In-Reply-To: Your message of 01 May 90 1626 PDT
Message-Id: <CMM.0.88.641838873.ejm@shasta.Stanford.EDU>
Who's the WE that paid a zillion dollars for oaks?
∂04-May-90 1109 @Sunburn.Stanford.EDU:farhad@Tehran.Stanford.EDU Re: Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 11:09:03 PDT
Received: from Tehran.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26901; Fri, 4 May 90 10:04:39 -0700
Received: by Tehran.Stanford.EDU with SMTP (5.61/25-eef) id AA00789; Fri, 4 May 90 10:04:26 -0700
Message-Id: <9005041704.AA00789@Tehran.Stanford.EDU>
To: Ed McCluskey <ejm@shasta.Stanford.EDU>
Cc: Robert W Floyd <RWF@SAIL.Stanford.EDU>, MPS@SAIL.Stanford.EDU,
csdlist@CS.STANFORD.EDU
Subject: Re: Bulletin Boards and First Aid Kits
In-Reply-To: Your message of "Fri, 04 May 90 09:34:33 PDT."
<CMM.0.88.641838873.ejm@shasta.Stanford.EDU>
Date: Fri, 04 May 90 10:04:25 PDT
From: Farhad Shakeri <farhad@Tehran.Stanford.EDU>
+------------------------------
| Who's the WE that paid a zillion dollars for oaks?
+------------------------------
∂04-May-90 1213 @Sunburn.Stanford.EDU:agupta@Neon.Stanford.EDU Oak panelling
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 12:13:27 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA29137; Fri, 4 May 90 11:11:40 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA19256; Fri, 4 May 90 11:11:34 -0700
Date: Fri, 4 May 1990 11:11:33 PDT
From: Ashish Gupta <agupta@Neon.Stanford.EDU>
To: ejm@shasta.Stanford.EDU
Cc: csdlist@cs.stanford.edu
Subject: Oak panelling
Message-Id: <CMM.0.88.641844693.agupta@Neon.Stanford.EDU>
PLEASE keep this discussion restricted to a bboard and
not clutter our mailboxes with this stuff.
ashish
∂04-May-90 1239 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu ride to Chaminade?
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 12:39:03 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02107; Fri, 4 May 90 12:38:54 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA17156; Fri, 4 May 90 12:39:13 PDT
Date: Fri, 4 May 90 12:39:13 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9005041939.AA17156@coraki.stanford.edu>
To: faculty@cs.Stanford.EDU
Subject: ride to Chaminade?
I'm planning to drive to Chaminade, leaving MJH around 6:30 to arrive
in time for the 8 pm panel discussion. Let me know if you'd like a
ride.
-v
∂04-May-90 1318 @Sunburn.Stanford.EDU:farhad@Tehran.Stanford.EDU Re: Bulletin Boards and First Aid Kits
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 13:18:09 PDT
Received: from Tehran.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27174; Fri, 4 May 90 10:12:26 -0700
Received: by Tehran.Stanford.EDU with SMTP (5.61/25-eef) id AA00802; Fri, 4 May 90 10:12:13 -0700
Message-Id: <9005041712.AA00802@Tehran.Stanford.EDU>
To: Ed McCluskey <ejm@shasta.Stanford.EDU>
Cc: Robert W Floyd <RWF@SAIL.Stanford.EDU>, MPS@SAIL.Stanford.EDU,
csdlist@CS.STANFORD.EDU
Subject: Re: Bulletin Boards and First Aid Kits
In-Reply-To: Your message of "Fri, 04 May 90 09:34:33 PDT."
<CMM.0.88.641838873.ejm@shasta.Stanford.EDU>
Date: Fri, 04 May 90 10:12:11 PDT
From: Farhad Shakeri <farhad@Tehran.Stanford.EDU>
+------------------------------
| Who's the WE that paid a zillion dollars for oaks?
+------------------------------
Wooben Estinhoovert aliased as WE. WE was a self declared
prophet on the fifth floor of MJH from 1900 to 1908. He
predicted the creation of the fifth floor and the 1989
Bay Area Earth Quake. So we should be thankful to him.
∂04-May-90 1325 hemenway@Sunburn.Stanford.EDU two more pieces of info
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 13:25:14 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04014; Fri, 4 May 90 13:25:56 -0700
Date: Fri, 4 May 1990 13:25:56 PDT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: phd-adm@Sunburn.Stanford.EDU
Subject: two more pieces of info
Message-Id: <CMM.0.88.641852756.hemenway@Sunburn.Stanford.EDU>
For those of you keeping close track, I have recently learned the
following:
Wee-Liang Heng is staying at UC-Berkeley.
John Thornley is going to Cal Tech.
--Sharon
∂04-May-90 1659 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU CAE Design verification tools for system-level design?
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 May 90 16:59:51 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12021; Fri, 4 May 90 16:56:54 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA24405; Fri, 4 May 90 16:54:45 -0700
Date: Fri, 4 May 1990 16:54:44 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: CAE Design verification tools for system-level design?
Message-Id: <CMM.0.88.641865284.tajnai@Hudson.Stanford.EDU>
At the AEA R&D Symposium I met Norman Kelly, VP Engineering for
Logic Modeling. He is interested in
"Computer Aided Engineering: design verification tools for system-level
design as opposed to IC levels."
Please let me know who is working in that area.
Thanks much,
Carolyn
∂05-May-90 1515 grundy@csli.Stanford.EDU Symbolic Systems Forum May 10
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 May 90 15:15:47 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA23768; Sat, 5 May 90 15:08:22 PDT
Date: Sat 5 May 90 15:08:21-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum May 10
To: grundy@csli.Stanford.EDU
Message-Id: <641945301.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, May 10, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: B. A. Huberman, Xerox Palo Alto Research Center
Topic: "The Problem of Idle Time"
ABSTRACT
--------
In any distributed organization, be it social or
computational, it is often the case that strong differences
arise in the amount of work performed by the individual
components. This unfairness of use results in strong
departures from optimality for the system as a whole, a
situation which is often corrected by a number of procedural
and structural changes.
This talk will describe the dynamics of resource
allocation in computer networks and show how fairness of use
cannot be achieved beyond a criticial size. I will then
demonstrate how the establishment of a hierarchy of process
transfer rates allows for optimal and stable dynamical load
balance in very large systems. I will also describe the
effects of information delays on fairness of use and show
that oscillations in resource utilization appear when such
delays exceed a certain value. These oscillations can be
prevented by the establishment of informal links in the
organization, in agreement with observations in the social
arena.
Refreshments will be served.
Next week, May 17:
Jean-Pierre Dupuy, French
"On the Self-Deconstruction of the Symbolic Order"
Note to bboard readers:
If you would like to receive Symbolic Systems Forum
mailings directly, please send a note to Bill Grundy
(grundy@csli).
-------
∂05-May-90 1622 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Revised Announcement..
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 May 90 16:22:37 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA29172; Sat, 5 May 90 16:15:35 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28960; Sat, 5 May 90 16:23:10 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17440; Sat, 5 May 90 16:22:49 -0700
Message-Id: <9005052322.AA17440@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4566; Sat, 05 May 90 17:09:07 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
4191; Sat, 05 May 90 17:09:04 CDT
Date: Fri, 4 May 90 09:30:22 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Der-Tsai Lee <dlee@note.nsf.gov>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: cc: worldsci%csd36.nyu.edu@eecs.nwu.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Der-Tsai Lee <dlee%note.nsf.gov@VM1.NoDak.EDU>
Subject: Revised Announcement..
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
ANNOUNCEMENT OF A NEW JOURNAL
ON
COMPUTATIONAL GEOMETRY AND APPLICATIONS
(Revised)
CALL FOR PAPERS
**********************************************************************
The International Journal of Computational Geometry & Applications is a
quarterly journal devoted to the field of computational geometry within
the framework of design and analysis of algorithms, and its applications
to various fields including computer-aided geometry design (CAGD),
computer graphics, constructive solid geometry (CSG), operations research,
pattern recognition, robotics, solid modelling, VLSI routing/layout,
and others.
Emphasis is placed on the computational aspects of geometric problems that
arise in various fields of science and engineering. Research contributions
ranging from theoretical results in algorithm design -- sequential or
parallel, probabilistic or randomized algorithms -- to applications in the
above-mentioned areas are welcome. Research findings or experiences in the
implementations of geometric algorithms, such as numerical stability,
and papers with a geometric flavor are also welcome.
MANAGING EDITOR: D. T. Lee, Northwestern University
EDITORIAL BOARD
Alok Aggarwal, IBM T. J. Watson Research Center
Tetsuo Asano, Osaka Electro-Communication University,Japan
Mikhail J. Atallah, Purdue University
Jean-Daniel Boissonnat, INRIA, France
Bernard Chazelle, Princeton University
David P. Dobkin, Princeton University
Ronald L. Graham, AT&T Bell Laboratories
Leonidas J. Guibas, Massachusetts Institute of Technology
Christoph M. Hoffmann, Purdue University
John E. Hopcroft, Cornell University
Masao Iri, University of Tokyo, Japan
David G. Kirkpatrick, University of British Columbia, CANADA
D. T. Lee, Northwestern University
R. C. T. Lee, National Tsing Hua University, Taiwan
Kurt Mehlhorn, Universitat des Saarlandes, West Germany
Joseph O'Rourke, Smith College
Franco P. Preparata, University of Illinois
Godfried T. Toussaint, McGill University, CANADA
Ralph Wachter, Office of Naval Research
Tony C. Woo, University of Michigan
F. Frances Yao, Xerox Palo Alto Research Center
Target Date for the 1st Issue: Jan-March 1990.
INFORMATION FOR AUTHORS
Submit 5 copies of each manuscript to the Managing Editor or to any member of
the Editorial Board. It is a major aim of this journal to minimize paper
processing time and to expedite printing. Therefore electronic submission of
papers in final form is strongly encouraged. Please include the phone number
and e-mail address, if known, of the correspondence author, when submitting
manuscripts. For more details please contact the Managing Editor or the
Publisher.
Prof D. T. Lee*
Managing Editor (IJCGA)
Department of Electrical Engineering
and Computer Science
Northwestern University
Evanston, IL 60208
E-mail: dtlee@eecs.nwu.edu
*Current address till August 1990:
Division of Computer and Computation Research, (Room 304)
National Science Foundation
1800 G St. NW
Washington DC 20550
(202) 357-7375
Publisher : World Scientific Publishing Co.
687 Hartwell Street, Teaneck, NJ 07666
(Singapore x New Jersey x London x Hong Kong)
∂05-May-90 1623 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 May 90 16:22:51 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA29174; Sat, 5 May 90 16:15:49 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28968; Sat, 5 May 90 16:23:23 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17443; Sat, 5 May 90 16:23:11 -0700
Message-Id: <9005052323.AA17443@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5965; Sat, 05 May 90 17:09:35 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5566; Sat, 05 May 90 17:09:33 CDT
Date: Fri, 4 May 90 09:30:48 -0400
Reply-To: Victor Millers Theorynet <THEORYNT%IBM.COM@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Victor Millers Theorynet <THEORYNT%IBM.COM@VM1.NoDak.EDU>
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
>From rscs@yktvmz.vnet.ibm.com Thu May 3 11: 50:58 1990
Received: from aides.watson.ibm.com by irt.watson.ibm.com (5.61+/1.34)
id AA10585; Thu, 3 May 90 11:50:58 -0400
Received: by aides.watson.ibm.com (DCE STD CONFIG 1.1 - AIX 2.2/1.26)
id AA04862; Thu, 3 May 90 11:48:48 EDT
Received: From YKTVMZ by WATSON with "RSCS.VIB"
id "A.STYER.NOTE.ALMVMD.9309.Thu.3.May.90.11:49:26.EDT"
for theorynt@watson; Thu, 3 May 90 11:48:46 EDT
Sender: rscs@yktvmz.watson.ibm.com
Received: from VM1.NoDak.EDU by IBM.COM (IBM VM SMTP R1.2.1MX) with TCP; Thu, 03
May 90 08:49:14 PDT
Received: from e.ms.uky.edu by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with TCP;
Thu, 03 May 90 10:47:38 CDT
Received: by g.ms.uky.edu id ab19537; 3 May 90 11:30 EDT
Received: from s.ms.uky.edu by g.ms.uky.edu id af19487; 3 May 90 11:15 EDT
To: theorynet-request%ibm.com@vm1.nodak.edu
Subject: Re: Is o(m n↑3) known for regexp size m matching string size n?
Newsgroups: comp.theory
In-Reply-To: <9005021756.AA08901@irt.watson.ibm.com>
Organization: Univ. of Kentucky
Cc:
Date: Thu, 3 May 90 11:11:41 EDT
From: Eugene Styer <styer@ms.uky.edu>
Sender: styer@ms.uky.edu
Message-Id: <9005031111.aa07437@s.s.ms.uky.edu>
Resent-To: theory-c@vm1.nodak.edu
Resent-Date: Fri, 04 May 90 09:30:46 -0400
Resent-From: theorynt
If the input string is much longer than the regular expression, then
converting the regular expression to a finite automata and simulating would
be proportional to n assuming a fixed regular expression. For a variable
regular expression, converting a regular expression to a nondeterministic
finite automata and simulating looks to be O(m↑2 n). I know fixed strings
can be searched for in O(m+n) time, and it wouldn't surprise me if
regular expressions could be brought down to O(mn), although I don't
have anything handy.
-----------------------------------------------------------------------
Eugene Styer styer@ms.uky.edu (606)-257-3496
957 POT, U. of Kentucky, Lexington, KY 40506
"* is sometimes called the Nathan Hale operator since he had but one asterisk"
∂05-May-90 1623 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Program for Workshop on Parallel Algorithms
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 May 90 16:23:04 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA29178; Sat, 5 May 90 16:16:01 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28973; Sat, 5 May 90 16:23:35 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17446; Sat, 5 May 90 16:23:22 -0700
Message-Id: <9005052323.AA17446@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6691; Sat, 05 May 90 17:11:37 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6513; Sat, 05 May 90 17:10:06 CDT
Date: Fri, 4 May 90 09:30:30 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Uzi Vishkin <vishkin@umiacs.umd.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Uzi Vishkin <vishkin%umiacs.umd.edu@VM1.NoDak.EDU>
Subject: Program for Workshop on Parallel Algorithms
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
WORKSHOP ON PARALLEL ALGORITHMS
May 17-18, 1990
Loews Annapolis Hotel
Annapolis, Maryland
UPDATE:
All further room reservations must be made
individually through Loews Annapolis Hotel by calling toll free, 800-
526-2593. Those making reservations should identify themselves as
participants in the UMIACS workshop. It is recommended that reservations
be made as soon as possible in order to guarantee accommodation.
(Due to the high number of people who have already registered for the
workshop no more rooms are reserved for us. However, the hotel will take
additional reservations subject to
availability.) Loews Annapolis Hotel accepts VISA, MasterCard,
American Express and Diner's Club credit cards.
PROGRAM
Wednesday, May 16
5:00 - Bus leaving the Omni Inner Harbor Hotel, Baltimore
following the last talk at the 22nd ACM Symposium on Theory of Computing
to the Loews Annapolis Hotel. NOTE: This is a time update.
6:30 - 8:00 A registration desk will be open, with material
on restaurants and tourist attractions..
No planned activity this evening.
Thursday, May 17
8:00 - 8:40 - Coffee, muffins
8:40 - 8:45 - Greetings, Larry Davis, Director, Institute for Advanced
Computer Studies, University of Maryland, College Park
8:45 - 9:45 - Leslie Valiant, Harvard University
"Bulk-synchronous Parallel Computers"
9:45 - 10:45 - Burton Smith, Tera Computer Company
"Architecture of the Tera Computer System"
10:45- 11:15 - Coffee break
11:15- 12:15 - John Reif, Duke University
"Efficient PRAM and Fixed Connection Network Algorithms
for Computational Geometry"
12:15- 2:15 - Lunch break
2:15 - 3:15 - Vijaya Ramachandran, University of Texas, Austin
"A Framework for Parallel Algorithm Design for
Undirected Graphs"
3:15 - 4:15 - Tom Leighton, Massachusetts Institute of Technology
"Recent Advances in Routing and Sorting Circuits"
4:15 - 5:30 - Reception
5:30 - 8:30 - No planned activity (enjoy Annapolis).
8:30 - 10:00 - Panel discussion
Friday, May 18
8:00 - 8:45 - Coffee, muffins
8:45 - 9:45 - Rao Kosaraju, Johns Hopkins University
"On the Parallel Evaluation of Classes and Circuits"
9:45 - 10:45 - Joseph JaJa, University of Maryland, College Park
"Parallel Algorithms for VLSI Layout"
10:45- 11:15 - Coffee break
11:15- 12:15 - Faith Fich, University of Toronto
"Lower Bounds for PRAM Computation"
12:15- - Lunch and adjournment.
SPONSORS
The workshop is funded by a joint grant, with New York University,
from the National Science Foundation and the Defense Advanced Research
Projects Agency, with additional support from the University of Maryland
Institute for Advanced Computer Studies, (UMIACS).
REGISTRATION
A $50 registration fee includes 2 lunches, a welcome reception on
May 17th and conference materials.
ACCOMMODATION
A limited number of double and single rooms are available for workshop
participants. These rooms will be given out on a first come first serve
basis. If you plan to attend, please make reservations early to guarantee
accommodation.
TRANSPORTATION
Loews Annapolis Hotel is located approximately 28 miles from Baltimore/
Washington International Airport. Round trip shuttle service is available
for $12 each way.
NOTICE
A bus will leave the STOC hotel in Baltimore immediately after the last
talk ends, at 5 pm (and NOT 6 as previously announced) on
Wednesday, May 16. Seats are available for a nominal fee. It is recommended
that reservations for the bus be made as soon as possible to guarantee a
seat. Contact Dawn Vance at 301/454-1808 or by e-mail, dawn@umiacs.umd.edu
if transportation is needed.
DIRECTIONS to The Loews Annapolis Hotel, 126 West Street, Annapolis,
Maryland 21401.
FROM BALTIMORE:
I-295S (Baltimore-Washington Parkway) to I-695S/Glen Burnie exit. Follow
I-695 to Route 3S, towards Annapolis. Follow Route 3S to Route 97/Annapolis.
Route 97 will merge with Route 50E (John Hanson Highway). Follow 50E to Route
70S (Roscoe Rowe Boulevard). Follow Rowe Blvd. through two lights. Stay in
the right lane and bear right onto Calvert Street. Follow Calvert Street
for one block and turn right onto West Street. Follow West Street for
1-1/2 blocks and turn right (at traffic light) into the hotel's arched
driveway; sign reads "The Annapolis Hotel".
FROM BWI AIRPORT:
Dorsey Road to Route 3S/Route 301S towards Richmond. Follow Route 3 to
Route 97/Annapolis. Route 97 will merge with Route 50E (John Hanson Highway).
Follow directions from Baltimore.
FROM THE CAPITAL BELTWAY:
I-95 to Interchange 19A (Route 50E/John Hanson Highway). Follow Route
50E for approximately 25 miles to Route 70S (Roscoe Rowe Boulevard).
Follow Rowe Blvd. through two lights. Stay in the right lane and bear
right onto Calvert Street. Follow Calvert Street for one block and turn
right onto West Street. Follow West Street for 1-1/2 blocks and
turn right (at traffic light) into the hotel's arched driveway; sign
reads "The Annapolis Hotel".
INFORMATION ABOUT ANNAPOLIS, MARYLAND
The State House is visible from almost every point in Maryland's Capital
City. Home of the US Naval Academy and located on the Chesapeake Bay,
Annapolis is known as the "sailing capital of the United States". The downtown
area is a registered Historic Landmark. Tourist guides refer to Annapolis as
a "museum without walls". The city boasts many quaint shops and a variety of
pleasant dining experiences nestling along the narrow streets dating back to
the American Revolution. A walking tour is one of the best ways to discover
the charm of Annapolis.
FURTHER INFORMATION
Contact Dawn Vance at (301) 454-1808 or by e-mail, dawn@umiacs.umd.edu,
or the workshop organizer, Uzi Vishkin,
Institute for Advanced Computer Studies, University of Maryland,
College Park, Maryland 20742;
phone (301) 454-1988; e-mail vishkin@umiacs.umd.edu.
______________
Workshop on Parallel Algorithms
May 17-18, 1990
Loews Annapolis Hotel - Annapolis, Maryland
REGISTRATION FORM
Name: _______________________________________________________
Affiliation: _______________________________________________________
Address: _______________________________________________________
_______________________________________________________
_______________________________________________________
Phone: _______________________________________________________
E-mail: _______________________________________________________
Transportation needed: _____ Yes _____ No
Registration Fee - $50.00. Registration fee includes lunch on Thursday
and Friday; a welcome reception; and conference materials.
Please make checks payable to the University of Maryland Foundation -
Parallel Algorithms Workshop. Mail check and registration form to:
Dawn Vance
UMIACS
A.V. Williams Building
University of Maryland
College Park, MD 20742
For further information, contact Dawn Vance by e-mail at dawn@umiacs.umd.
edu or by calling (301) 454-1808.
∂06-May-90 0841 @Sunburn.Stanford.EDU:shs@hutcs.hut.fi Your e-mail article
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 May 90 08:41:17 PDT
Received: from santra.hut.fi by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22674; Sun, 6 May 90 08:42:09 -0700
Received: from hutcs.hut.fi by santra.hut.fi
(5.61++/7.0/TeKoLa) id AA06156; Sun, 6 May 90 18:41:49 +0300
Received: by hutcs.hut.fi (4.0/6.8/S-TeKoLa)
id AA08306; Sun, 6 May 90 18:41:11 +0300
From: Reijo Sulonen <shs@hutcs.hut.fi>
Message-Id: <9005061541.AA08306@hutcs.hut.fi>
Subject: Your e-mail article
To: mccarthy@cs.stanford.edu
Date: Sun, 6 May 90 18:41:11 EET DST
Cc: shs@hutcs.hut.fi (Reijo Sulonen)
X-Mailer: ELM [version 2.3 PL0]
Dear Professor McCarthy
Some time ago I read your letter published in CACM on the issue of
electonic mail. The minimalistic view and idea about a simple and
stable address seemed just right.
Could you kindly give me some pointers to some people who are elaborating your
idea?
With best regards
Reijo Sulonen
Professor of Computer Science
Helsinki University of Technology
SF-02150 Espoo
∂06-May-90 1807 @Theory.Stanford.EDU,@Neon.Stanford.EDU:LISTSERV@VM1.NoDak.EDU Your subscription to list THEORYNT
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 May 90 18:07:30 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA00325; Sun, 6 May 90 18:00:23 -0700
Received: from vm1.NoDak.edu by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18508; Sun, 6 May 90 18:07:56 -0700
Message-Id: <9005070107.AA18508@Neon.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7541; Sun, 06 May 90 20:06:36 CDT
Received: by NDSUVM1 (Mailer R2.03B) id 7540; Sun, 06 May 90 20:06:34 CDT
Date: Sun, 6 May 90 20:06:34 CDT
From: Revised List Processor (1.6d) <LISTSERV@VM1.NoDak.EDU>
Subject: Your subscription to list THEORYNT
To: Local Distribution <aflb-tn@NEON.STANFORD.EDU>
Cc: THEORYNET-REQUEST@IBM.COM, THEORYNT%YKTVMZ.BITNET@forsythe.stanford.edu
Dear networker,
As of Sunday, May the 6th of 1990, you have been added to the LISTSERV
distribution list THEORYNT (TheoryNet List) by Marty Hoag <NU021172@NDSUVM1>.
The Theoretical Computer Science (TheoryNet) list consists of three
different sub-lists. You may subscribe or signoff these lists to tailor the
information you receive. Most users subscribe to the main list
(THEORYNT@VM1.NoDak.EDU or THEORYNT@NDSUVM1.Bitnet) and receive all three types
of item.
THEORY-A: Announcements of conferences, journals, and other events where
world-wide participation is solicited.
THEORY-B: Announcements of ongoing seminar series, distinguished lectures,
etc.
THEORY-C: All other material, such as problems, queries, etc.
THEORYNT: All of the above.
The moderator of the TheoryNet lists is Victor Miller
TheoryNet-Request@IBM.COM or
THEORYNT@YKTVMZ on Bitnet
You may leave the list at any time by sending a "SIGNOFF THEORYNT" command to
LISTSERV@NDSUVM1. Please note that this command must NOT be sent to the list
address (THEORYNT@NDSUVM1) but to the LISTSERV address (LISTSERV@NDSUVM1).
Contributions sent to this list are automatically archived. You can obtain a
list of the available archive files by sending an "INDEX THEORYNT" command to
LISTSERV@NDSUVM1. These files can then be retrieved by means of a "GET THEORYNT
filetype" command, or using the database search facilities of LISTSERV. Send an
"INFO DATABASE" command for more information on the latter.
You may also obtain copies of the list notebooks via anonymous FTP to
VM1.NoDak.EDU (192.33.18.30, userid Anonymous, any password). Once validated do
a CD LISTARCH and DIR THEORYNT.* to see the notebooks available. Our file
system is NOT hierarchical so you must do a CD ANONYMOUS if you want to return
to the "root".
Please note that it is presently possible for anybody to determine that you
are signed up to the list through the use of the "REVIEW" command, which
returns the network address and name of all the subscribers. If you do not wish
your name to be available to others in this fashion, just issue a "SET THEORYNT
CONCEAL" command.
More information on LISTSERV commands can be found in the "General
Introduction guide", which you can retrieve by sending an "INFO GENINTRO"
command to LISTSERV@NDSUVM1.
Virtually,
The LISTSERV management
∂07-May-90 0932 chandler@Sunburn.Stanford.EDU Tomorrow's faculty meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 09:19:06 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA01569; Mon, 7 May 90 09:19:40 -0700
Date: Mon, 7 May 1990 9:19:40 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: tenured@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Tomorrow's faculty meeting
Message-Id: <CMM.0.88.642097180.chandler@Sunburn.Stanford.EDU>
Good morning "tenured". Come one down and take a look at the papers for
Linda Petzold and Lloyd Trefethen (the two SCCM candidates), and be sure your
calendars are marked for tomorrow's facutly meeting, 2:30 in MJH-140.
∂07-May-90 0958 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU Want to spend 3 to 6 months in Japan?
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 09:57:53 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02884; Mon, 7 May 90 09:57:36 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA02230; Mon, 7 May 90 09:55:23 -0700
Date: Mon, 7 May 1990 9:55:22 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: csl-students@csl, csl-faculty@csl, phd@cs.Stanford.EDU,
faculty@cs.Stanford.EDU
Subject: Want to spend 3 to 6 months in Japan?
Message-Id: <CMM.0.88.642099322.tajnai@Hudson.Stanford.EDU>
Dr. Koichi Ejiri of Ricoh just called. They are interested in having
someone work at Ricoh in Japan for 3 to 6 months. Recent PHD or someone
more advanced.
If you are interested, please contact Dr. Ejiri. 415/854-7640
Carolyn Tajnai
∂07-May-90 1025 chandler@Sunburn.Stanford.EDU Farewell Reception for Sharon Hemenway
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 10:25:41 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04704; Mon, 7 May 90 10:25:25 -0700
Date: Mon, 7 May 1990 10:25:23 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, staff@cs.Stanford.EDU, phd@cs.Stanford.EDU
Subject: Farewell Reception for Sharon Hemenway
Message-Id: <CMM.0.88.642101123.chandler@Sunburn.Stanford.EDU>
Come one....come all. Join us to say a fond farewell to Sharon Hemenway who
will be leaving soon to relocate on the East Coast. Come on down to the
Psychology Courtyard (Behind Margaret Jacks) on Wednesday, May 16 at 4:00.
∂07-May-90 1048 winkler@Sunburn.Stanford.EDU Knuth conversation
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 10:48:36 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA05865; Mon, 7 May 90 10:49:35 -0700
Date: Mon, 7 May 1990 10:49:35 PDT
From: Phyllis Winkler <winkler@Sunburn.Stanford.EDU>
To: jmc-lists@sail.Stanford.EDU
Subject: Knuth conversation
Message-Id: <CMM.0.88.642102575.winkler@Sunburn.Stanford.EDU>
John, confirming what you and Don talked about on Saturday:
Please send
1) A reference to the 91 function (the earlier the better)
2) A reference to the Takenchi function and/or the address of
Ikuo Takenchi (spelling?? - Phyllis)
Please send it to PHY@sail instead of dek
- Phyllis
∂07-May-90 1246 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Bershad
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 12:46:05 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09492; Mon, 7 May 90 12:45:59 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA23430; Mon, 7 May 90 12:44:19 PDT
Date: Mon, 7 May 90 12:44:19 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9005071944.AA23430@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Bershad
Brian Bershad and I talked today, and he said that
he was at CMU all last week (this explains why we
couldn't reach him by phone after our faculty meeting).
He has, sadly, decided to accept an offer from CMU.
-Nils
∂07-May-90 1329 chandler@Sunburn.Stanford.EDU Tomorrow's faculty lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 13:29:37 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11305; Mon, 7 May 90 13:29:42 -0700
Date: Mon, 7 May 1990 13:29:40 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU, stefik@cs.Stanford.EDU,
psz@sumex-aim.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Subject: Tomorrow's faculty lunch
Message-Id: <CMM.0.88.642112180.chandler@Sunburn.Stanford.EDU>
See you all tomorrow at 12:15 in Margaret Jacks Hall room 146 for our weekly
faculty lunch. Bob Street will be our guest to talk about Action Plans for Change.
∂07-May-90 1332 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU CSD chairmanship
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 13:32:10 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10147; Mon, 7 May 90 13:07:58 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA23461; Mon, 7 May 90 13:06:18 PDT
Date: Mon, 7 May 90 13:06:18 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9005072006.AA23461@Tenaya.Stanford.EDU>
To: csd-list@cs.stanford.edu
Subject: CSD chairmanship
I am pleased to be able to announce that discussions
between the Dean and our faculty (including Jeff Ullman) have resulted in the
Dean and Jeff agreeing that Jeff will be the
next chairman of the CS Dept. for a term of three years
beginning Sept. 1, 1990. I will be working closely with
Jeff over the next months (until I disappear in mid-July)
to help achieve a smooth transition. Jeff is going to
be a great chairman and already has some experience
(he served as an acting chair once for several months). I can think of no one who
is more devoted to the welfare of the Department than Jeff is.
The job of being chairperson is tough work and, to be done
well, requires the cooperation of all of us. You could give
no greater expression of congratulations to Jeff than by letting
him know that you hereby can be counted on to do xxxx----whatever
xxxx your skills and conscience say is appropriate.
-Nils
∂07-May-90 1332 chandler@Sunburn.Stanford.EDU NSF Program Announcement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 13:32:41 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA11394; Mon, 7 May 90 13:31:30 -0700
Date: Mon, 7 May 1990 13:31:29 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: NSF Program Announcement
Message-Id: <CMM.0.88.642112289.chandler@Sunburn.Stanford.EDU>
I have just received the following announcement from NSF and will be happy to
send you a copy.
Program for Long and Medium-Term Research at Foreign Centers of Excellence.
∂07-May-90 1408 @Theory.Stanford.EDU,@Neon.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ACM Election, The Sequel
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 14:08:49 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA01304; Mon, 7 May 90 14:01:36 -0700
Received: from vm1.NoDak.edu by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA19520; Mon, 7 May 90 14:09:07 -0700
Message-Id: <9005072109.AA19520@Neon.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1750; Mon, 07 May 90 15:32:17 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
1713; Mon, 07 May 90 15:32:15 CDT
Date: Mon, 7 May 90 11:51:50 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
dsj@research.att.com
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: dsj%research.att.com@VM1.NoDak.EDU
Subject: ACM Election, The Sequel
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Given the initial response to my previous posting, it appears that
the campaign statements of the candidates for ACM office aren't as
decipherable as I thought. Several people have asked me for more explicit
guidance, so I guess I'm not going to be able to avoid more direct
electioneering. Here goes:
The key race is the one for President. Bryan Kocher, current President,
has broken with tradition and is running for a second term.
He won election the first time as a petition candidate on an
"ACM needs new leadership" platform, but I think it was more a vote AGAINST
the then-current leadership than for Bryan, who frankly does not have
the stature, either as a practitioner or as a researcher, that I think ACM
needs in its leader.
(I note that in his biography he lists "Using Hidden Features of 1-2-3,"
from the Proceedings of the 1985 ACM Northeast Region Conference
as one of his major publications, along with his President's columns
in CACM, which I will let speak for themselves.)
During his two years in office, he has been an ineffectual leader, with
no real sympathy for either the SIGs or the research community.
The other two candidates for President are both well-qualified, but rather
than split the vote, I would recommend voting for John White.
John is a past Chair of SIGPLAN and of the SIGBOARD, and has
been instrumental in many of the positive changes that have been going
on in ACM recently, both as SIGBOARD Chair and in his current position
on the ACM Executive Committee (a committee that has been making
progress in spite of Kocher, rather than because of him). I've had
a very good working relationship with him, and he has always been
sympathetic to SIGACT's problems and interests.
The other two national offices (Vice-President and Secretary) are also
important, as both are ex officio members of the Executive Committee, but
there are no obvious klinkers in the nominees here. I do note that
Ron Oliver, running for Vice-President, is current Chair of the SIGBOARD
and has been very effective in that post, and that SIGACT's own Barbara
Simons is running for Secretary.
This has been an unpaid political announcement.
David Johnson
∂07-May-90 1415 chandler@Sunburn.Stanford.EDU Tay Sachs Screening
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 14:15:02 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13201; Mon, 7 May 90 13:53:04 -0700
Date: Mon, 7 May 1990 13:53:02 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: csdlist@Sunburn.Stanford.EDU
Subject: Tay Sachs Screening
Message-Id: <CMM.0.88.642113582.chandler@Sunburn.Stanford.EDU>
The following announcement has been received in the Chairman's office from
the Medical Center:
Stanford University is offering a free Tay Sachs carrier screening to be held
Wednesday, May 16 and Thursday, May 17.
This simple blood test takes 5 minutes and identifies healthy individuals who
carry the recessive gene for Tay Sachs Disease. Carrier rates are 1 in 150
in the general population and 1 in 30 in the Jewish population. It is
recommended that anyone who is of Jewish ancestry or has a partner of Jewish
origin be tested. This is important information for future pregnancy
planning; it is not necessary to be planning a pregnancy to warrant testing.
Tay Sachs testing is not available through private physicians so we encourage
people to be tested now. Prevention of the disease is only possible if one's
carrier status is known. The 1988 Tay Sachs screening detected 10 carriers
out of 133 individuals screened.
∂07-May-90 1454 chandler@Sunburn.Stanford.EDU Tay Sachs Screening
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 14:54:27 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14345; Mon, 7 May 90 14:12:55 -0700
Date: Mon, 7 May 1990 14:12:54 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: csdlist@Sunburn.Stanford.EDU
Subject: Tay Sachs Screening
Message-Id: <CMM.0.88.642114774.chandler@Sunburn.Stanford.EDU>
Tay Sachs screening to be done:
Wednesday, May 16 - 11:00-2:00 - Tressider Union, Oak Lounge West
5:30-7:30 - Business School, Room 54
Thursday, May 17 - 8:00-10:00am - Med. Center M106 (Medical Students Lounge)
11:00-2:00 - Tressider Union, Oak Lounge Wet
∂07-May-90 1542 LOGMTC-mailer Z talk
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 15:42:29 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18057; Mon, 7 May 90 15:43:29 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA23057; Mon, 7 May 90 15:43:27 PDT
Message-Id: <9005072243.AA23057@coraki.stanford.edu>
To: logic@cs.stanford.edu
Subject: Z talk
Date: 07 May 90 15:43:27 PDT (Mon)
From: pratt@cs.Stanford.EDU
Z following talk should be of considerable interest to anyone interested
in specification languages. Bring your own shoes.
-v
------- Forwarded Message
Date: Mon, 7 May 90 15:31:07 PDT
From: sankar@mycroft.Stanford.EDU (Sriram Sankar)
To: csl-everyone@sierra.Stanford.EDU
Subject: Special Seminar (May 14th)
Mike Spivey, one of the primary designers of the Z specification language,
from Tektronix Inc. will speak at our next week's PAVG Seminar. Everyone
is welcome.
Mike may have time for informal discussions following the seminar. Let me
know if you wish to meet with him.
Sriram.
==========================================================================
THE Z APPROACH TO SOFTWARE SPECIFICATION
Mike Spivey
Monday, May 14th, 2.30pm, ERL401
Z is an approach to the specification of software systems based on the
systematic application of simple mathematics. An important part of Z
is the schema notation, a facility for structuring specifications into
manageable pieces or schemas. In this seminar, I shall introduce the Z
notation and style by shoeing a complete specification of a simple
software system.
==========================================================================
------- End of Forwarded Message
∂07-May-90 1545 gilberts@Sunburn.Stanford.EDU Performance Appraisals Due
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 15:45:05 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18117; Mon, 7 May 90 15:45:10 -0700
Date: Mon, 7 May 1990 15:45:09 PDT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: MJHstaff@Sunburn.Stanford.EDU, Faculty@Sunburn.Stanford.EDU
Subject: Performance Appraisals Due
Message-Id: <CMM.0.88.642120309.gilberts@Sunburn.Stanford.EDU>
CSD Supervisor,
Reminder....
Please meet with your 'supervisee', complete your
CS performance review, and turn in the two (or three)
forms. They are due in the Dean's office by May 9th.
Thank you.
-Edie
∂07-May-90 1554 @Theory.Stanford.EDU,@Neon.Stanford.EDU:axwang@Theory.Stanford.EDU AFLB this Thursday
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 15:53:28 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA01431; Mon, 7 May 90 15:39:08 -0700
Received: from Baal.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA27866; Mon, 7 May 90 15:46:52 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA10583; Mon, 7 May 90 15:46:13 -0700
Message-Id: <9005072246.AA10583@Baal.Stanford.EDU>
To: aflb-all@neon.Stanford.EDU
Subject: AFLB this Thursday
Date: Mon, 07 May 90 15:46:07 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
This Thursday's speaker will be Jack Snoeyink, from Stanford. AFLB
will meet in MJH 252 at 12:00pm.
Title: A trivial knot with exponential-sized spanning disks
How does one determine if a closed polygonal curve in space is knotted
or if it can be pulled into a circle without crossing itself or being
cut? Though this ``knot triviality'' problem is known to be
decidable, it is not known to be in polynomial time. Furthermore, the
mathematical tools commonly used for this problem---knot groups and
knot polynomials---lead to computationally intractable problems.
Rather than look at algebraic certificates of knot triviality, we
could look at geometric certificates, such as the Seifert surface.
If a knot is the boundary of a polyhedral surface without holes or
self-intersections, then it is trivial---it can be untied without
cutting.
Researchers have conjectured that every knot has a `spanning surface'
with only polynomially many facets; if this were true then knot
triviality would be in NP. Unfortunately, we disprove this conjecture
by exhibiting trivial knots composed of $n$ line segments that require
exp(c n) facets, for a positive constant c. The proof uses a
geometric approach: slicing the knot and its spanning surface and
discovering their geometric structure.
I expect the talk to be self contained, but be sure you bring your
lunch because the algorithmic content will be small.
∂07-May-90 1634 sweeney@cis.Stanford.EDU Copper Interconnections for VLSI - EE 310
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 16:34:07 PDT
Received: from cis.Stanford.EDU by sierra.Stanford.EDU (4.0/4.7); Mon, 7 May 90 16:32:18 PDT
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA19615; Mon, 7 May 90 16:31:36 PDT
Date: Mon, 7 May 90 16:31:36 PDT
From: sweeney@cis.stanford.edu (Irene Sweeney)
Message-Id: <9005072331.AA19615@cis.Stanford.EDU>
To: ee-faculty@sierra.Stanford.EDU, iclabusers@glacier.Stanford.EDU
Subject: Copper Interconnections for VLSI - EE 310
EE 310 SEMINAR
ON: COPPER INTERCONNECTIONS FOR VLSI
BY: SIMON WONG,
CIS STANFORD UNIVERSITY
Interconnect has been, is and will be a key factor in
the continuous advancement of integrated systems.
This presentation will describe the advantages of Cu
as an interconnection material the latest development in
selective Cu deposition techniques and the potential
problems associated with Cu.
IN: AEL 109
DATE: TUESDAY, MAY 8, 1990
AT: 4:15 P.M.
PLEASE NOTE:
ROOM CHANGE FOR THIS WEEK - AEL 109
∂07-May-90 1642 hemenway@Sunburn.Stanford.EDU Ph.D. Evaluation Comments
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 May 90 16:42:04 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA21528; Mon, 7 May 90 16:41:59 -0700
Date: Mon, 7 May 1990 16:41:58 PDT
From: "Sharon R. Hemenway" <hemenway@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: Ph.D. Evaluation Comments
Message-Id: <CMM.0.88.642123718.hemenway@Sunburn.Stanford.EDU>
This is to urge those of you who have not yet done so to please respond
to Mike Genesereth's message of a couple of weeks ago and send me
evaluation comments about your Ph.D. students. The Ph.D. program
committee will be relying quite heavily on your comments when
they evaluate the progress of students and lack of information
from you will be interpreted as a negative opinion.
I would like to receive everyone's input by the end of this week.
Many thanks--
Sharon
∂08-May-90 1003 @Sunburn.Stanford.EDU:NA.PHL@Forsythe.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 10:03:53 PDT
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03786; Tue, 8 May 90 10:03:52 -0700
Message-Id: <9005081703.AA03786@Sunburn.Stanford.EDU>
Date: Tue, 8 May 90 10:04:21 PDT
To: faculty@cs.Stanford.EDU
From: "Portia Leet" <NA.PHL@Forsythe.Stanford.EDU>
TO: Sunrise Distribution
FROM: Portia Leet
RE: Sunrise Club, May 22nd
The final 1989-90 meeting of the Sunrise Club will be on Tuesday,
May 22nd at 7:30 a.m. in Tresidder Union Oak Lounge West. Dr.
Charles F. Goochee of the Chemical Engineering Department will speak
on "Emerging Issues in the Production of Human Pharmaceutical
Products Using Genetic Engineering Technology." Breakfast will be
served and the meeting will finish by 9:00 a.m.
Chuck Goochee studies factors affecting growth and product formation
for cultured mammalian and insect cells. His work addresses the
effects of environmental factors on protein post-translational
modifications, including glycosylation, sulfation, and
phosphorylation.
At this meeting, we will have some tables designated for specific
interests. As you sign in, you will be able to indicate at which
table you would like to sit.
If you plan to attend, please RSVP to me at na.phl@forsythe or by
phone 5-1585.
To: SUNRISE(CT.JFK,CT.MJF,CT.PAC,CT.VLS,DOWN@SIERRA,EE-FACULTY@SIERRA,
FACULTY@CS,FULLERTON@SIERRA,HAGSTROM@SIERRA,KRUGER@SIERRA,
LEVINTHAL@SIERRA,NA.ADP,NA.PHL,PHD@CS,REIS@SIERRA,RES-ASSOC@CS,
TAJNAI@CS), JC.PAB
∂08-May-90 1007 fely@sierra.Stanford.EDU Dave Grossman's Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 10:07:45 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 8 May 90 10:06:42 PDT
Date: Tue, 8 May 90 10:06:42 PDT
From: fely@sierra.Stanford.EDU (Fely Barrera)
To: ee-faculty@sierra
Cc: fely@sierra
Subject: Dave Grossman's Seminar
Message-Id: <CMM.0.88.642186401.fely@>
EE 310 Seminar
May 15, 1990
CIS 101, 4:15 pm
===================================================================
PARALLEL COMPUTING, SEMICONDUCTOR MANUFACTURING, & THE VIRTUAL WAFER FAB
Dave Grossman
IBM Corporation
Abstract
Parallel computing is expected to become progressively more pervasive
during this decade. While the robotics community is aggressively
pursuing applications of parallelism to real-time automation and
control, the semiconductor manufacturing community is not. One
exception to this generalization is the real-time control system for
an experimental wafer reactor in CIS.
This will be a three part talk:
The first section will present some forecasts of the future of
parallel computing and of semiconductor manufacturing.
The second part will discuss the design of a parallel processor
starting to be used in CIS for real-time control of wafer processing.
The third section will discuss the potential for a future project to
build a complete virtual wafer fab.
The unifying theme of the talk is that vast compute power is coming,
so there are opportunities to be much more ambitious in finding ways
to use it.
===================================================================
∂08-May-90 1021 NA.PHL@Forsythe.Stanford.EDU
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 10:21:42 PDT
Received: from Forsythe.Stanford.EDU by sierra.Stanford.EDU (4.0/4.7); Tue, 8 May 90 10:20:27 PDT
Date: Tue, 8 May 90 10:04:21 PDT
To: ee-faculty@sierra
From: "Portia Leet" <NA.PHL@Forsythe.Stanford.EDU>
TO: Sunrise Distribution
FROM: Portia Leet
RE: Sunrise Club, May 22nd
The final 1989-90 meeting of the Sunrise Club will be on Tuesday,
May 22nd at 7:30 a.m. in Tresidder Union Oak Lounge West. Dr.
Charles F. Goochee of the Chemical Engineering Department will speak
on "Emerging Issues in the Production of Human Pharmaceutical
Products Using Genetic Engineering Technology." Breakfast will be
served and the meeting will finish by 9:00 a.m.
Chuck Goochee studies factors affecting growth and product formation
for cultured mammalian and insect cells. His work addresses the
effects of environmental factors on protein post-translational
modifications, including glycosylation, sulfation, and
phosphorylation.
At this meeting, we will have some tables designated for specific
interests. As you sign in, you will be able to indicate at which
table you would like to sit.
If you plan to attend, please RSVP to me at na.phl@forsythe or by
phone 5-1585.
To: SUNRISE(CT.JFK,CT.MJF,CT.PAC,CT.VLS,DOWN@SIERRA,EE-FACULTY@SIERRA,
FACULTY@CS,FULLERTON@SIERRA,HAGSTROM@SIERRA,KRUGER@SIERRA,
LEVINTHAL@SIERRA,NA.ADP,NA.PHL,PHD@CS,REIS@SIERRA,RES-ASSOC@CS,
TAJNAI@CS), JC.PAB
∂08-May-90 1042 chandler@Sunburn.Stanford.EDU ["R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU> : Farewell
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 10:42:30 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA06151; Tue, 8 May 90 10:41:56 -0700
Date: Tue, 8 May 1990 10:41:55 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, staff@cs.Stanford.EDU, phd@cs.Stanford.EDU
Subject: ["R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU> : Farewell
Reception for Sharon Hemenway ]
Message-Id: <CMM.0.88.642188515.chandler@Sunburn.Stanford.EDU>
Shortly after this message was sent out we learned that Aleta Akhtar
(Sharon's assistant) is also leaving Stanford to relocate in Pittsburgh.
Let's take this opportunity to also bid a fond farewell to Aleta.
---------------
Return-Path: <chandler>
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA04704; Mon, 7 May 90 10:25:25 -0700
Full-Name: R. Joyce Chandler
Date: Mon, 7 May 1990 10:25:23 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, staff@cs.Stanford.EDU, phd@cs.Stanford.EDU
Subject: Farewell Reception for Sharon Hemenway
Message-Id: <CMM.0.88.642101123.chandler@Sunburn.Stanford.EDU>
Come one....come all. Join us to say a fond farewell to Sharon Hemenway who
will be leaving soon to relocate on the East Coast. Come on down to the
Psychology Courtyard (Behind Margaret Jacks) on Wednesday, May 16 at 4:00.
∂08-May-90 1529 gerlach@sierra.Stanford.EDU Special Parking Hearing
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 15:21:22 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 8 May 90 15:19:40 PDT
Date: Tue, 8 May 90 15:19:40 PDT
From: gerlach@sierra.Stanford.EDU (Sharon Gerlach)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Cc: gerlach@sierra.Stanford.EDU
Subject: Special Parking Hearing
Message-Id: <CMM.0.88.642205179.gerlach@>
Greetings,
The following is an announcement of a Special Hearing of the Committee on
Parking and Transportation which will be held this Thursday. This message
was sent last week, but the distribution did not include everyone in EE.
Sharon
----------------------------------------------------------------------
At the request of your colleagues, and with the special assistance of Ken
Down, the Committee on Parking and Transportation (CPT) will be holding an
extra public hearing on its proposals for parking and transportation policies
for the 1990's.
The hearing will be:
Thursday, May 10
Terman Auditorium
12 noon - 1 p.m.
The purpose of the meeting is to hear community reactions to the committee's
draft recommendations, before finalizing its report to President Kennedy. We
have already received a good number of written comments from Engineering
School folks, and the committee members have read them all. At the meeting,
we hope to hear further thoughts, and to have a chance for follow-up
discussions of some of your ideas.
Most useful of all will be alternative proposals, if you think the ones we've
put forward wouldn't be workable or fair. We're all engaged in a community
effort to allocate finite resources, and we need creative ideas.
Julia Fremon, Transportation Programs
Staff to the CPT
PS. Ken Down has copies of the Committee proposals if you would like to
review them again. Please request from the information desk on the second
floor of Terman, Room 202.
∂08-May-90 1605 LOGMTC-mailer Seminar in Logic and Foundations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 16:05:35 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20517; Tue, 8 May 90 16:06:35 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA15984; Tue, 8 May 90 16:07:48 PDT
Date: Tue, 8 May 1990 16:07:41 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.642208061.sf@csli.stanford.edu>
Speaker: Dr. Michiel van Lambalgen, Univ. of Amsterdam and MSRI
Title: On so-called "information theoretic incompleteness theorems"
Time: Monday May 14, 4:15-5:30 PM
Place: Room 381-T, first floor, Math Corner, Stanford
Abstract:
In the first part of the talk we shall present a critical examination of
Chaitin's version (using Kolmogorov complexity) of the first incompleteness
theorem. In the second part we relate this version to a recent proof
of Boolos (Notices AMS, April 1989).
∂08-May-90 1616 goodman@sierra.Stanford.EDU An Opportunity for a graduating senior
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 16:16:46 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 8 May 90 16:15:37 PDT
From: goodman@sierra.Stanford.EDU (Joseph W. Goodman)
To: ee-faculty@sierra.Stanford.EDU
Subject: An Opportunity for a graduating senior
Date: Tue, 08 May 90 16:15:35 PDT
Stewart Personic of Bellcore called me today to describe
an opportunity for a graduating senior. Bellcore supports
a program run by Carnegie Mellon under which about 40
individuals attend that institution for 14 months to
study both the technology and the business aspects of
telecommunications and its interface with computing.
At the end of that time the individual gets an MS
degree in something like "Information Networking".
Bellcore pays a salary to the individual attending, as
well as all costs. Summer employment with Bellcore is
part of the package. If you are aware of an
outstanding graduating senior who has not already
decided what to do next year, and might be interested
in this program, please have him or her contact me.
There is some time urgency.
Joe
∂08-May-90 1751 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU PYI for Anoop
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 17:51:16 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24006; Tue, 8 May 90 17:51:20 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA24308; Tue, 8 May 90 17:49:38 PDT
Date: Tue, 8 May 90 17:49:38 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9005090049.AA24308@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: PYI for Anoop
Cc: kruger@sierra.stanford.edu, gibbons@sierra.stanford.edu
We just heard the official news that Anoop Gupta
has been awarded a Presidential Young Investigator
Award. Congratulations, Anoop!
-Nils
∂08-May-90 1753 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Mitchell to Assoc Prof
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 17:53:48 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24049; Tue, 8 May 90 17:54:09 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA24316; Tue, 8 May 90 17:52:27 PDT
Date: Tue, 8 May 90 17:52:27 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9005090052.AA24316@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Mitchell to Assoc Prof
Somehow I missed the official word about this,
but the Board of Trustees has approved the promotion
of John Mitchell to the rank of Associate Professor
for a term of 9/1/90 through 8/31/94.
Congratulations, John!
-Nils
∂09-May-90 0746 chandler@Sunburn.Stanford.EDU May 1 General Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 07:46:25 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA29718; Wed, 9 May 90 07:47:17 -0700
Date: Wed, 9 May 1990 7:47:17 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: jlh@amadeus.Stanford.EDU, zm@sail.Stanford.EDU,
jmc-lists@sail.Stanford.EDU, gio@SUMEX-AIM.Stanford.EDU,
weise@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, mps@cs.Stanford.EDU,
margaret@mojave.Stanford.EDU
Subject: May 1 General Faculty Meeting
Message-Id: <CMM.0.88.642264437.chandler@Sunburn.Stanford.EDU>
This is a follow-up to my e-mail message of May 3. A vote was taken at the
May 1 general faculty meeting to appoint Brian N. Bershad and Marc Lavoy
Assistant Professors in the Computer Science Department. Since then Bershad
has accepted a faculty position elsewhere. The faculty where were present at
the meeting voted unanimously in favor of making the appointments. Please
let me know at your earliest opportunikty what your vote is on Lavoy. Thanks much.
∂09-May-90 0848 carlstea@sierra.Stanford.EDU Parking and Transportation Hearing
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 08:48:53 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Wed, 9 May 90 08:46:29 PDT
Date: Wed, 9 May 90 08:46:29 PDT
From: carlstea@sierra.Stanford.EDU (Mary L. Carlstead)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU,
cis-people@glacier
Subject: Parking and Transportation Hearing
Message-Id: <CMM.0.88.642267987.carlstea@>
Please read the Daily of this morning, Wed. May 9th, regarding the proposed
parking changes and the 25% increase in fees (an "A" sticker will be $200,
a "C" sticker will be $50, and a proposed free "D" sticker for use in an
outlying area (e.g. the Track House or the old Stock Farm barn). The article
does not discuss the possibility of a "rationing plan" for parking spaces.
There will be a special hearing tomorrow, Thursday, at noon in Terman
Auditorium.
∂09-May-90 1315 chandler@Sunburn.Stanford.EDU OUTSTANDING ANTHROPOLOGICAL CREATIVITY AWARD
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 13:15:16 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10885; Wed, 9 May 90 13:15:21 -0700
Date: Wed, 9 May 1990 13:15:20 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: OUTSTANDING ANTHROPOLOGICAL CREATIVITY AWARD
Message-Id: <CMM.0.88.642284120.chandler@Sunburn.Stanford.EDU>
An annual award for outstanding creativity, open to all Stanford students,
has been created by the Department of Anthropology. The $500 award, the
inspiration of retiring anthropology Professor Robert B. Textor, will be made
from a fund endowed by Prof. Textor's former students, his faculty
colleagues, and the Textor family.
Any faculty member, regardless of school or department, may nominate any
student, undergraduate or graduate, for the award. "The nominee might have
chosen a traditional anthropological problem, but this is not necessary,"
Prof,. Textor noted; "All that is necessary is that she or he have employed
approaches to a significant problem that are in some reasonable sense
anthropological, and outstandingly creative. The problem could involve such
areas as, for example, public or educational policy, social equity, positive
self-image formation, nutrition and health, the sociocultural implications of
new technology, environmental preservation, the examined life, etc."
No more than one award will be given in an academic year. If in the
Department's judgment none of the nominees in a given year meets the
criteria, no award will be made. In years when a winner is selected, the
award will be presented at the winner's departmental commencement ceremony.
So that a first award might be possible this June, nominations are due by
5:00 p.m. on Friday, May 25. A faculty member wishing to nominate a student
should submit a brief memo stating why he or she believes this student's work
to be outstandingly creative, and enclose evidence of such creativity-a term
paper, a master's essay, a doctoral dissertation, a research proposal, a
film, a mathematical or graphic model, a computer program, etc. Materials
should be addressed to Creativity Award, Department of Anthropology, Mail
Code 2145. Fur further information call 723-4641.
∂09-May-90 1345 jones@Sunburn.Stanford.EDU Be a Freshman Advisor
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 13:45:41 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA12490; Wed, 9 May 90 13:45:50 -0700
Date: Wed, 9 May 1990 13:45:50 PDT
From: "H. Roy Jones" <jones@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: Be a Freshman Advisor
Message-Id: <CMM.0.88.642285950.jones@Sunburn.Stanford.EDU>
The Undergraduate Advising Center is recruiting advisors for the Freshman
Advising Program. Advisors are assigned 6-8 students who live in the same
residence and whose preliminary academic interest lies in their general
field, in our case, engineering. The UAC runs an advisor orientation that
explains the basic information you need to know. It takes about 10-15 hours
a quarter. I have done it a number of times and have found it to be most
enjoyable. Nils Nilsson, Steve Fisher, Stuart Reges, and Ralph Gorin have
all been involved with the program at various points so you might ask them,
or me, about it if you have any questions.
Let me know if you are interested and I'll send you a reply form.
Roy
∂09-May-90 1358 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:LISTSERV@VM1.NoDak.EDU Your subscription to list THEORYNT
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 13:58:40 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04162; Wed, 9 May 90 13:51:20 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22022; Wed, 9 May 90 13:59:15 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA13119; Wed, 9 May 90 13:59:03 -0700
Message-Id: <9005092059.AA13119@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4976; Wed, 09 May 90 15:57:49 CDT
Received: by NDSUVM1 (Mailer R2.03B) id 4972; Wed, 09 May 90 15:57:48 CDT
Date: Wed, 9 May 90 15:57:47 CDT
From: Revised List Processor (1.6d) <LISTSERV@VM1.NoDak.EDU>
Subject: Your subscription to list THEORYNT
To: Local Distribution <aflb-tn@CS.STANFORD.EDU>
Cc: THEORYNET-REQUEST@IBM.COM, THEORYNT%YKTVMZ.BITNET@forsythe.stanford.edu
Dear networker,
As of Wednesday, May the 9th of 1990, you have been added to the LISTSERV
distribution list THEORYNT (TheoryNet List) by ND HECN Postmaster
<INFO@NDSUVM1>.
The Theoretical Computer Science (TheoryNet) list consists of three
different sub-lists. You may subscribe or signoff these lists to tailor the
information you receive. Most users subscribe to the main list
(THEORYNT@VM1.NoDak.EDU or THEORYNT@NDSUVM1.Bitnet) and receive all three types
of item.
THEORY-A: Announcements of conferences, journals, and other events where
world-wide participation is solicited.
THEORY-B: Announcements of ongoing seminar series, distinguished lectures,
etc.
THEORY-C: All other material, such as problems, queries, etc.
THEORYNT: All of the above.
The moderator of the TheoryNet lists is Victor Miller
TheoryNet-Request@IBM.COM or
THEORYNT@YKTVMZ on Bitnet
You may leave the list at any time by sending a "SIGNOFF THEORYNT" command to
LISTSERV@NDSUVM1. Please note that this command must NOT be sent to the list
address (THEORYNT@NDSUVM1) but to the LISTSERV address (LISTSERV@NDSUVM1).
Contributions sent to this list are automatically archived. You can obtain a
list of the available archive files by sending an "INDEX THEORYNT" command to
LISTSERV@NDSUVM1. These files can then be retrieved by means of a "GET THEORYNT
filetype" command, or using the database search facilities of LISTSERV. Send an
"INFO DATABASE" command for more information on the latter.
You may also obtain copies of the list notebooks via anonymous FTP to
VM1.NoDak.EDU (192.33.18.30, userid Anonymous, any password). Once validated do
a CD LISTARCH and DIR THEORYNT.* to see the notebooks available. Our file
system is NOT hierarchical so you must do a CD ANONYMOUS if you want to return
to the "root".
Please note that it is presently possible for anybody to determine that you
are signed up to the list through the use of the "REVIEW" command, which
returns the network address and name of all the subscribers. If you do not wish
your name to be available to others in this fashion, just issue a "SET THEORYNT
CONCEAL" command.
More information on LISTSERV commands can be found in the "General
Introduction guide", which you can retrieve by sending an "INFO GENINTRO"
command to LISTSERV@NDSUVM1.
Virtually,
The LISTSERV management
∂09-May-90 1507 ingrid@russell.Stanford.EDU CSLI Calendar, 10 May, vol. 5:27
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 15:07:11 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA17153; Wed, 9 May 90 14:34:19 PDT
Date: Wed, 9 May 90 14:34:19 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005092134.AA17153@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 10 May, vol. 5:27
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
10 May 1990 Stanford Vol. 5, No. 27
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 10 MAY 1990
12:00 noon TINLunch
Cordura 100 Logical Consequence and Model-Theoretic
Consequence, I: Etchemendy's Critique of the
Tarskian Analysis
Greg O'Hair
Visiting Scholar from The Flinders University
of South Australia
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 4
led by Stanley Peters
Title: Derivation vs. Constraints in Syntax
Speakers: Joan Bresnan, Ivan Sag, Peter Sells
(bresnan@csli.stanford.edu, sag@csli.stanford.edu,
sells@csli.stanford.edu)
(peters@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 17 MAY 1990
12:00 noon TINLunch
Cordura 100 Logical Consequence and Model-Theoretic
Consequence, II: Lessons and Perspectives
Greg O'Hair
Visiting Scholar from The Flinders University
of South Australia
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 5
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Derivation vs. Constraints in Syntax
Speakers: Joan Bresnan, Ivan Sag, Peter Sells
(bresnan@csli.stanford.edu, sag@csli.stanford.edu,
sells@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Logical Consequence and Model-Theoretic Consequence, II:
Lessons and Perspectives
Greg O'Hair
The previous talk examined John Etchemendy's arguments against the
Tarskian analysis of logical truth and logical consequence. In this
talk, I look at some possible reactions to his critique, and some
perspectives suggested by it.
____________
NEXT WEEK'S CSLI SEMINAR
Controversies in Natural-Language Research 5
Derivation vs. Constraints in Syntax
Joan Bresnan, Ivan Sag, Peter Sells
We will address the issue of how to characterize the various levels of
structure needed in syntax: Should there be uniformity across levels,
as in RG and GB? Should the underlying levels of structure of UG be
characterized in the formal categorial structure of familiar standard
European languages (INFL, VP, etc.), as in GB? And generally, how
abstract is/are underlying levels of syntactic representation?
____________
SYMBOLIC SYSTEMS FORUM
The Problem of Idle Time
B. A. Huberman
Xerox Palo Alto Research Center
Thursday, 10 May, 4:15 p.m.
Building 60, Room 61G
In any distributed organization -- be it social or computational -- it
is often the case that strong differences arise in the amount of work
performed by the individual components. This unfairness of use
results in strong departures from optimality for the system as a
whole, a situation that is often corrected by a number of procedural
and structural changes.
This talk will describe the dynamics of resource allocation in
computer networks and show how fairness of use cannot be achieved
beyond a critical size. I will then demonstrate how the establishment
of a hierarchy of process transfer rates allows for optimal and stable
dynamical load balance in very large systems. I will also describe
the effects of information delays on fairness of use and show that
oscillations in resource utilization appear when such delays exceed a
certain value. These oscillations can be prevented by the
establishment of informal links in the organization, in agreement with
observations in the social arena.
Next week, 17 May: On the Self-Deconstruction of the Symbolic Order,
Jean-Pierre Dupuy, French & Italian Department, Stanford University.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Equality, Responsibility, and Justice
John Harsanyi
University of California, Berkeley
Friday, 11 May, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Nonnative Englishes: Implications from Sri Lankan English
Kanthasamy Parvathy
Friday, 11 May, 3:30 p.m.
Cordura 100
Nonnative Englishes are linguistic orphans in search of their parents,
whether they are institutionalized or noninstitutionalized. Braj
Kachru (1982) identifies the "accent bar" as that which continues to
segregate the nonnative English from native English. The secondary
indicators of nonnative English are grammatical morphemes.
In this talk, I'll demonstrate that Sri Lankan English users belong to
three different groups with respect to certain aspects of their
knowledge of English grammatical morphemes. Even group 1 -- the users
of the institutionalized variety of South Asian English -- has some
nonstandard intuitions about the use of grammatical morphemes. Groups
2 and 3 do not use the institutionalized variety. They use it only as
a performance variety, i.e., a variety used for special purposes. The
three groups differ in their grammatical performance to a great
extent. Reflecting a universal linguistic tendency for some
grammatical categories (e.g., number, tense) to be more resistant to
deletion than others (e.g., case) (Kiparsky, 1972), avoidance of
articles, prepositions, etc.\ is common among Tamils. For example,
beginning a sentence with a preposition is very rare and prepositional
stranding is never found in speech patterns at all.
In the second language-learning strategy, as usual, transfer takes
place in Tamil. The conceptual transfer is common in a new context,
e.g., "I am going home." The institutionalized English speakers use
this phrase, but many members of the other groups use the preposition
"to" before "home." This is a conceptual transfer of case from the
Tamil directional morpheme "ku," "to." This is a conceptual transfer,
not just a direct transfer, since "ku" is a suffix in Tamil, not a
particle.
The use of grammatical forms by various groups is analyzed based on a
preliminary random sample of seventy-five informants, twenty-five from
each of three groups. The effect of six variables on the
grammaticality was studied. The three groups have significant
differences. Statistical probability of certain types of questions
established the group as the most significant variable (my hypothesis,
too). Types of schools, residences, parents', or informants' own
occupations seem to tally with the significance of the group.
My research:
-- Linguistically, the difficult grammatical areas for the learners are
identified, and the relative degrees of difficulty in acquiring
grammatical morphemes are identified by statistical reliability tests.
-- Sociolinguistically, the ANOVA identifies which of the variables is
the most significant.
-- Pedagogically, it suggests that a teacher of English should
categorize the students into different groups and reveals why they
have difficulties. It also helps a teacher to select or prepare
appropriate materials for the students.
____________
COMMONSENSE AND NONMONOTONIC REASONING SEMINAR
Neural Net Representation of a Truth Maintenance System
Paul Morris
Intellicorp
Monday, 14 May, 2:30 p.m.
Margaret Jacks Hall 252
We show how label updating for a justification-based TMS may be
accomplished within a neural net model. In this approach, the IN
status of a TMS node or justification is represented dynamically by a
continuously firing neuron, rather than statically as a memory trace.
This novel perspective leads to a way of defining wellfoundedness in
terms of local constraints. It also suggests an epistemic
interpretation of a neural net as a kind of "fuzzy" TMS.
____________
POETICS WORKSHOP
Unstressed Syllables in the Rhythmic Patterns
of Contemporary Russian Verse
Vycheslav Ivanov
Moscow University
Tuesday, 15 May, 4:00 p.m.
Ventura 17
No abstract available.
____________
SYNTAX WORKSHOP
Title to be announced
Robert Van Valin
Tuesday, 15 May, 7:30 p.m.
Cordura 100
No abstract available.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Culture and the Autonomic Architecture of Emotion
Robert Levenson
University of California, Berkeley
Wednesday, 16 May, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
∂09-May-90 1533 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Problem in Partial Orders !! Help needed !!
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 15:33:26 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04265; Wed, 9 May 90 15:26:02 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28778; Wed, 9 May 90 15:33:53 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16748; Wed, 9 May 90 15:33:31 -0700
Message-Id: <9005092233.AA16748@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5404; Wed, 09 May 90 17:28:22 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5324; Wed, 09 May 90 17:28:19 CDT
Date: Wed, 9 May 90 13:48:36 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"Sanjiv K. Bhatia" <sanjiv@fergvax.unl.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "Sanjiv K. Bhatia" <sanjiv%fergvax.unl.edu@VM1.NoDak.EDU>
Subject: Problem in Partial Orders !! Help needed !!
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
We have an interesting problem in partial orders. Given a partial order (P, <),
we are intersted in determining a set of elements which form a maximum
antichain, i.e., a set of maximum cardinality such that any two elements of
this set are incomparable.
We are sure that there exists a polynomial algorithm to do so. This is because
we can determine the maximum independent set in a comparability graph in
polynomial time. But we want to solve this problem directly in partial orders.
Any pointers to a solution will be greatly appreciated.
--
Sanjiv K. Bhatia Department of Computer Science
sanjiv@fergvax.unl.edu University of Nebraska - Lincoln
(402)-472-3485 Lincoln, NE 68588-0115
∂09-May-90 1551 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ICIAM Update
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 15:51:06 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04312; Wed, 9 May 90 15:43:42 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00109; Wed, 9 May 90 15:51:37 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16764; Wed, 9 May 90 15:34:00 -0700
Message-Id: <9005092234.AA16764@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 5813; Wed, 09 May 90 17:30:13 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
5713; Wed, 09 May 90 17:29:04 CDT
Date: Wed, 9 May 90 14:01:51 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
ICIAM '91 <ICIAM@wharton.upenn.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: ICIAM '91 <ICIAM%wharton.upenn.edu@VM1.NoDak.EDU>
Subject: ICIAM Update
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The Second International Conference on Industrial and Applied Mathematics
ICIAM Update
o More than 1200 applied and computational mathematicians, engineers and
scientists worldwide have already sent in requests for abstract and
minisymposium proposal forms for ICIAM 91.
o More than 35% of the requests are from outside the U.S.A.
o More than 60 representatives throughout the world are distributing ICIAM 91
materials.
o Proposals and abstracts already received encompass exciting and recent
advances in applied and computational mathematics.
o It's not too early!
ICIAM 91 is truly anticipated as an international forum for applied and
computational mathematicians and users of mathematics. Be a part of it....
organize a minisymposium....contribute a paper....come to Washington D.C. If
you still haven't told us of your interests, send in the attached form and
make sure you stay on the ICIAM 91 mailing list.
ICIAM 91--July 8-12, 1991, Washington, D.C., USA
Message to SIAM Members:
ICIAM 91 is an important international event that will occur every four years.
It is meant to spotlight the applied and computational community and focus
worldwide attention on mathematics professionals. There will be no SIAM Annual
Meeting in 1991. Make plans instead to come to ICIAM 91.
See you in D.C.!
Invited Presentations*
Dynamic Energy Minimization and Phase Transformations in Solids
John M. Ball
Department of Mathematics
Heriot-Watt University, Scotland
Intermediate Asymptotics in Micromechanics
Grigorii I. Barenblatt
Institute of Oceanography
USSR Academy of Sciences, USSR
Mathematical and Computational Models of Vision
Michael Brady
Department of Engineering Science
University of Oxford, Great Britain
Aspects of Constrained Optimization
Andrew R. Conn
Department of Combinatorics and Optimization
University of Waterloo, Canada
Modulation Equations Arising in the
Mechanics of Continuous Media
Wiktor Eckhaus
Mathematisch Instituut
Rijksuniversiteit te Utrecht, The Netherlands
Some Industrial Problems Solved in the Framework of the
European Consortium of Mathematics in Industry
Antonio Fasano
Istituto Mathematico "U. Dini"
Universita Degli Studi (Firenze), Italy
Numerical Solution of Linear Algebraic Equations
Arising from Convection-Diffusion Equations
Gene H. Golub
Department of Computer Science
Stanford University, USA
Discrete Mathematics in Manufacturing
Martin Groetschel
Institut fuer Mathematik
Universitaet Augsburg, West Germany
Computational Methods for Chemically Reacting Flow
Thomas J.R. Hughes
Division of Applied Mechanics
Stanford University, USA
Interior Point Methods in Optimization
Narendra K. Karmarkar
Mathematical Sciences Research Center
AT&T Bell Laboratories, USA
Forced Nonlinear Surface Waves
Klaus W. Kirchgassner
Institut fuer Mathematik
Universitaet Stuttgart, West Germany
Optimal Control and Viscosity Solutions
Pierre-Louis Lions
Universite de Paris IX, France
Wavelets and Applications to Numerical Analysis
Yves F. Meyer
CEREMADE
Universite Paris Dauphine, France
Dynamics of Patterns, Waves and Interfaces from the
Reaction-Diffusion Aspect
Masayasu Mimura
Department of Mathematics
Hiroshima University, Japan
Generation of Biological Pattern and the Formulation of
Morphogenetic Flows
James D. Murray
Center for Mathematical Biology, University of Oxford, Great Britain, and
Department of Applied Mathematics, University of Washington, USA
Radar Architectures--From Microwave Processing to Computational Power
Gabriel Ruget
Defense and Control Systems Division
Thomson CSF, France
Advances in Strongly Polynomial Linear Programming Algorithms
Eva Tardos
School of Operations Research and Industrial Engineering
Cornell University, USA
Applications of Massively Parallel Computing
David J. Wallace
Department of Physics
University of Edinburgh, Scotland
Computational Modeling of Flows in Porous Media
Mary F. Wheeler
Department of Mathematics
University of Houston, USA
Hierarchical Finite Elements and Related Preconditioners for
Elliptic Partial Differential Equations
Harry Yserentant
Fachbereich Mathematik
Universitaet Dortmund, West Germany
_______________
*Titles of presentations tentative.
Conference Topics
Applied and Computational Mathematics, Computer Science, Applied Probability
and Statistics, Scientific Computing, and Applications in Engineering and the
Biological, Chemical, and Physical Sciences.
Minisymposia Proposals
The ICIAM 91 Program Committee invites you, as a potential organizer, to
submit a proposal for a minisymposium.
A minisymposium is a session of 3-5 speakers focusing on a single topic.
Sessions may be scheduled for two or three hours. The organizer of a
minisymposium invites the speakers and decides on the topics they are to
address. If you would like to organize a minisymposium, you must submit a
proposal on an ICIAM minisymposium form. Acceptance of proposals will be by
decision of the ICIAM 91 Program Committee.
To obtain a form and guidelines for submitting a minisymposium proposal,
please complete the attached card and return it to SIAM promptly.
Deadline date for minisymposium proposals: July 31, 1990
Contributed Presentations - Posters and Lectures
Participate in ICIAM 91 by submitting a paper, which you may present in
lecture or poster format. The ICIAM 91 Program Committee is encouraging
contributors to present their papers in poster form to increase communication
among participants, foster the development of international friendships, and
reduce the need for large numbers of parallel sessions.
Authors will have approximately 15 minutes for contributed presentations
(lecture format), with an additional 5 minutes for questions. Alternatively,
they may elect the poster format that encourages interactive discussions with
individuals interested in their work using flip charts and other visual aids.
If you desire to present a paper (lecture or poster format), you must submit a
summary not exceeding 100 words on an ICIAM 91 contributed paper/poster
presentation form or facsimile. You may also submit an abstract via e-mail.
Macros are available in LaTeX or TeX. To receive macros via e-mail contact
iciam@wharton.upenn.edu. Papers will be reviewed by the program committee.
Everyone who submits a paper will be notified by mail regarding acceptance.
To obtain a form and guidelines for submitting a paper, please complete the
attached card and return it to SIAM promptly.
Deadline date for submission of contributed presentation forms: September 30,
1990.
Registration Information and Announcements
To obtain future announcements, the ICIAM 91 program, and registration
information, please complete the attached card and return it to SIAM promptly.
If you have questions about ICIAM 91, write to:
ICIAM 91 Conference Manager
c/o SIAM
3600 University City Science Center
Philadelphia, PA 19104-2688, USA
E-MAIL: iciam@wharton.upenn.edu
FAX (TELECOPY): (215) 386-7999
PHONE: (215) 382-9800
Exhibitor Information
Booths and combined exhibits will be available to companies wishing to display
their products and/or services. To ensure that you receive an exhibitor kit,
please check the appropriate box(es) on the attached card and return it to
SIAM promptly.
About ICIAM 91
The conference organizers are developing a program that will focus worldwide
attention on the importance of mathematical and computational methods in the
solution of real world problems. A major exposition of computer hardware and
software exhibits and demonstrations that will enable you to explore
state-of-the-art technology is also planned.
In addition to a program highlighting important advances in research and
applications, there will be many opportunities for you to meet your colleagues
from other countries. A directory of preregistered attendees and exhibitors
(preregistered up to 3 weeks prior to conference) will be available at the
conference. A supplement for the balance of attendees will be available after
the conference.
To find out about the many exciting features of ICIAM 91 as they are
announced, please complete the enclosed card and return it to SIAM promptly.
Accommodations
The conference will take place in Washington, D.C., at the Sheraton
Washington, where SIAM is holding a block of rooms for those wishing to stay
at the conferene site. The Sheraton is a modern air-conditioned hotel with
2,000 guest rooms, 25 meeting rooms, an exercise room, a large outdoor
swimming pool, and many restaurants and lounge areas. It is located on the
city's "Metro" subway system which provides easy inexpensive access to most
points of interest.
The hotel, on 12 acres of a wooded park-like setting, is within walking
distance of the National Zoo, a few blocks from the National Cathedral,
Embassy Row, historic Georgetown and Rock Creek Park. The Sheraton Washington
boasts a multi-lingual staff fluent in a total of 20 languages, foreign
currency exchange services, telex facilities, and electrical adapters. A U.S.
post office is on the premises.
For those seeking more economical accommodations, there will be a limited
number of dormitory rooms available on a first come first served basis at
George Washington University, just a few Metro stops away from the Sheraton
Washington.
Local Attractions
Washington is a world capital and an international city. There will be
opportunities during the conference to visit government buildings, museums,
and the more than 100 well-known historic sites. Travelers to Washington may
enjoy the city's stately memorials, the Smithsonian complex of 14 museums and
galleries (including the Air and Space Museum), the Capitol Building, and the
White House. Other local attractions include Mount Vernon, the John F. Kennedy
Center for the Performing Arts, the National Gallery of Art, the National
Geographic Society Explorer Hall, and the Arlington National Cemetery. Self-
guided and guided tour information for Washington, D.C. will be available to
you at the conference. These are just a few of the historic sites, 80% of
which offer free admission and are open to the public seven days a week.
There will be more information on local attractions in the Preliminary
Program, so be sure to send in the attached card to ensure that you receive
this valuable information.
Transportation
Washington is served by three major airports--the Baltimore-Washington
International Airport, National Airport, and Dulles International Airport.
There is frequent Amtrak train service between Washington and New York.
Once in Washington, the Metro Subway System can take you to the host hotel, or
almost any other point of interest in the most economical way. Taxis are
reasonably priced and easy to obtain.
Program Committee
Robert E. O'Malley Jr., Chair
Rensselaer Polytechnic Institute
Robert Azencott
Universite de Paris-Sud (SMAI)
Franco Brezzi
Universita di Pavia (SIMAI)
Carlo Cercignani
Polytecnico Istitut di Milano (SIMAI)
John E. Dennis, Jr.
Rice University (SIAM)
Peter J. Deuflhard
Konrad-Zuse-Centrum fuer Informationstechnik (GAMM)
Iain S. Duff
Harwell Laboratory (IMA)
J.C.R. Hunt
University of Cambridge (IMA)
P.A. Raviart
Universite de Paris VI (SMAI)
Ivar Stakgold
University of Delaware (SIAM)
Adriaan H.P. Van der Burgh
Delft University of Technology (NRCI)
Wolfgang L. Wendland
Universitaet Stuttgart (GAMM)
Standing Committee
Roger Temam, Chair
Universite Paris-Sud
Vinicio Boffi
Consiglio Nazionale delle Richerche
C. William Gear, ICIAM 91 President
University of Illinois at Urbana-Champaign
Douglas S. Jones
University of Dundee
Patrick Lascaux
Centre d'Etudes de Limeil
Robert M. M. Mattheij
Technische Universiteit Eindhoven
James McKenna
Bellcore
Jean-Claude Nedelec
Ecole Polytechnique
Helmut Neunzert
Universitat Kaiserslautern
Ronald A. Scriven
Central Electricity Research Laboratory
Alberto Tesei
Istituto per le Applicazioni del Calcolo
"Mauro Picone"
Wolfgang Walter
Universitat Karlsruhe
Sponsoring Societies
Gesellschaft fur Angewandte Mathematik und Mechanik (GAMM)
Institute of Mathematics and Its Applications (IMA)
Societa Italiana di Matematica Applicata e Industriale (SIMAI)
Societe de Mathematiques Appliquees et Industrielles (SMAI)
Society for Industrial and Applied Mathematics (SIAM)
With the cooperation of
Institut National de Recherche en Informatique et en Automatique (INRIA)
Hosted by SIAM
∂09-May-90 1551 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU NIPS SUBMISSIONS AND REGISTRATION
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 15:51:36 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04316; Wed, 9 May 90 15:44:14 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00125; Wed, 9 May 90 15:52:10 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17395; Wed, 9 May 90 15:51:38 -0700
Message-Id: <9005092251.AA17395@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6148; Wed, 09 May 90 17:30:42 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6021; Wed, 09 May 90 17:29:54 CDT
Date: Wed, 9 May 90 14:02:14 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
nips90 <nips-90@cs.yale.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: nips90 <nips-90%cs.yale.edu@VM1.NoDak.EDU>
Subject: NIPS SUBMISSIONS AND REGISTRATION
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
This message corrects a previous message sent out yesterday.
*************NIPS SUBMISSIONS AND REGISTRATION*****************
Note there is about only 1 week left for your submission to NIPS.
Please send six copies of both your 50-100 word abstracts and
1000 word summaries by MAY 17th to:
John Moody
NIPS*90 Submissions
Department of Computer Science
Yale University
P.O. Box 2158 Yale Station
New Haven, Conn. 06520
****ALL SUBMITTING AUTHORS WILL BE SENT REGISTRATION****
*******MATERIALS AUTOMATICALLY!*******
DEADLINE FOR SUMMARIES & ABSTRACTS IS MAY 17, 1990
(see big green poster for more detail on
NIPS topics for abstracts and summaries)
*************NIPS REGISTRATION ONLY!*****************
If you are not sending in a submission for NIPS, but would
still like to attend, please request registration materials from:
Kathie Hibbard
NIPS*90 Local Committee
Engineering Center
University of Colorado
Campus Box 425
Boulder, CO 80309-0425
-- John Moody
Program Chairman
-------
∂09-May-90 1553 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU New journal: Computational Complexity
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 15:53:04 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04338; Wed, 9 May 90 15:45:42 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00219; Wed, 9 May 90 15:53:26 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17408; Wed, 9 May 90 15:52:08 -0700
Message-Id: <9005092252.AA17408@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6485; Wed, 09 May 90 17:33:52 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6436; Wed, 09 May 90 17:30:34 CDT
Date: Wed, 9 May 90 14:02:21 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Joachim von zur Gathen <gathen@cs.toronto.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Joachim von zur Gathen <gathen%cs.toronto.edu@VM1.NoDak.EDU>
Subject: New journal: Computational Complexity
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
COMPUTATIONAL COMPLEXITY
This new journal presents outstanding research in
computational complexity. Its subject is at the interface
between mathematics and theoretical computer science,
yet with a clear mathematical profile and strictly
mathematical format.
The central topics are:
- Models of computation, complexity bounds (with particular emphasis on lower
bounds), complexity classes, trade-off results
- for sequential and parallel computation
- for ``general'' (Boolean) and ``structured'' computation
(e.g., decision trees, arithmetic circuits)
- for deterministic, probabilistic, and nondeterministic computation
Specific areas include the following:
- Structure of complexity classes (reductions, relativization questions,
degrees)
- Algebraic complexity (bilinear complexity; computations for
polynomials, groups, algebras, and representations)
- Cryptography, zero-knowledge proofs
- Complexity issues in computational geometry, robotics, and motion planning
- Complexity issues in learning theory
- Complexity issues in number theory
- Complexity issues in logic (complexity of logical theories,
cost of decision procedures)
- Complexity issues in combinatorial optimization, and approximate solutions
- Complexity issues in distributed computing
This is not meant as an exhaustive list; other areas may also be considered.
Occasionally, special issues will be dedicated to a single topic.
An international Editorial Board guarantees worldwide
coverage of the activity in this field.
Birkhauser Verlag, Basel, Switzerland, will publish the journal.
The first issue is scheduled for 1991.
Four issues of about 100 pages each will make up one annual volume.
Authors are encouraged (but not required) to submit
final versions of accepted papers in camera-ready form.
Authors will receive 50 reprints free of charge.
This journal is essential reading for mathematicians
and theoretical computer scientists working in this
area to keep track of recent results in computational
complexity.
The current Editorial Board is as follows.
Managing editor:
Joachim von zur Gathen,
Department of Computer Science,
University of Toronto,
Toronto, Ontario,
CANADA M5S 1A4,
(416) 978-6024,
gathen@theory.toronto.edu
Associate editors:
Claus-Peter Schnorr,
Fachbereich Mathematik,
Universitaet Frankfurt,
Postfach 11 19 32,
D-6000 Frankfurt/Main,
WEST GERMANY,
unido!rbiffm!schnorr@uunet.uu.net,
Arnold Schoenhage,
Institut fuer Informatik, Abteilung II,
Universitaet Bonn,
Roemerstrasse 164,
D-5300 Bonn 1,
WEST GERMANY
Volker Strassen,
Fakultaet fuer Mathematik,
Universitaet Konstanz,
Postfach 5560,
D-7750 Konstanz 1,
WEST GERMANY
Editorial Board:
Laszlo Babai,
Department of Computer Science,
University of Chicago,
Ryerson Hall, 1100 E 58th St.,
Chicago, IL,
USA 60637,
(312) 702-3486,
laci@cs.uchicago.edu
Eric Bach,
Department of Computer Science,
University of Wisconsin,
Madison, WI,
USA 53706,
(608) 262-7997,
bach@cs.wisc.edu
Michael Ben-Or,
Department of Computer Science,
Hebrew University,
Jerusalem 91904,
ISRAEL,
benor@humus.huji.ac.il,
+
IBM Research Center,
Yorktown Heights, NY,
USA 10598
Allan Borodin,
Department of Computer Science,
University of Toronto,
Toronto, Ontario,
CANADA M5S 1A4,
(416) 978-6416,
bor@theory.toronto.edu
Stephen Cook,
Department of Computer Science,
University of Toronto,
Toronto, Ontario,
CANADA M5S 1A4,
(416) 978-5183,
sacook@theory.toronto.edu
Merrick Furst,
Computer Science Department,
Yale University,
New Haven, CT,
USA 06520
Zvi Galil,
Computer Science Department,
Columbia University,
New York, NY,
USA 10027,
(212) 663-5779,
galil@cs.columbia.edu
Hans de Groote,
Fachbereich Mathematik der,
Johann Wolfgang Goethe-Universit{eat,
D-6000 Frankfurt a.M.,
WEST GERMANY
Johan Hastad,
Royal Institute of Technology,
Stockholm,
SWEDEN 100 44
Joos Heintz,
Instituto Argentino de Matem{atica,
Viamonte 1636,
(1055) Buenos Aires,
ARGENTINA,
+
Fachbereich Mathematik,
Johann Wolfgang Goethe-Universit{eat,
D-6000 Frankfurt/M,
WEST GERMANY
Eugene M. Luks,
Computer & Information Science,
University of Oregon,
Eugene, OR,
USA 97403,
(503) 686-4408,
luks@cs.uoregon.edu
Stephen R. Mahaney,
Dept of Computer Science,
Univ of Arizona,
Tucson, AZ,
USA 85721,
(602) 621-2733,
srm@arizona.edu
Andrew Odlyzko,
AT\&T Bell Laboratories,
Room 2C-370,
Murray Hill, NJ,
USA 07974,
(201) 582-7286,
amo@research.att.com
Michael S. Paterson,
Department of Computer Science,
University of Warwick,
Coventry CV4 7AL,
GREAT BRITAIN,
paterson\%warwick.uucp@ucl-cs.arpa
Eli Upfal,
IBM Almaden Research Center,
650 Harry Rd.,
K53/801,
San Jose, CA,
USA 95120,
(408) 927-1788,
ely@almvma.bitnet
Leslie G. Valiant,
Aiken Computation Laboratory,
Harvard University,
Cambridge, MA,
USA 02138,
(617) 495-5817,
valiant@harvard.harvard.edu
Umesh V. Vazirani,
Department of Computer Science,
University of California at Berkeley,
Berkeley, CA,
USA 94720,
(415) 642-0572,
vazirani@ernie.berkeley.edu
Volker Weispfenning,
Fakultaet fur Mathematik und Informatik,
Universitaet Passau,
D-8390 Passau,
WEST GERMANY,
weispfen@unipas.uucp
Avi Wigderson,
Computer Science Department,
Hebrew University,
Jerusalem,
ISRAEL,
avi@humus.huji.ac.il
Andrew C.C. Yao,
Department of Computer Science,
Princeton University,
Princeton, NJ,
USA 08544,
(609) 452-5182,
yao@princeton.edu
Three copies of a submission should be forwarded to the
one of the editors.
∂09-May-90 1554 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 15:54:12 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04347; Wed, 9 May 90 15:46:41 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA00246; Wed, 9 May 90 15:54:36 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17461; Wed, 9 May 90 15:53:26 -0700
Message-Id: <9005092253.AA17461@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6921; Wed, 09 May 90 17:34:36 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
6825; Wed, 09 May 90 17:31:24 CDT
Date: Wed, 9 May 90 14:02:07 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Victor Millers Theorynet <THEORYNT@IBM.COM>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Victor Millers Theorynet <THEORYNT%IBM.COM@VM1.NoDak.EDU>
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
>From rscs@yktvmz.vnet.ibm.com Mon May 7 18: 01:44 1990
Received: from aides.watson.ibm.com by irt.watson.ibm.com (5.61+/1.34)
id AA19335; Mon, 7 May 90 18:01:44 -0400
Received: by aides.watson.ibm.com (DCE STD CONFIG 1.1 - AIX 2.2/1.26)
id AA18174; Mon, 7 May 90 17:59:34 EDT
Received: From YKTVMZ by WATSON with "RSCS.VIB"
id "A.LISTSERV.NOTE.ALMVMD.5899.Mon.7.May.90.17:58:31.EDT"
for theorynt@watson; Mon, 7 May 90 17:59:32 EDT
Sender: rscs@yktvmz.watson.ibm.com
Received: from VM1.NoDak.EDU by IBM.COM (IBM VM SMTP R1.2.1MX) with TCP; Mon, 07
May 90 14:58:18 PDT
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP
id 3644; Mon, 07 May 90 16:56:59 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
3643; Mon, 07 May 90 16:56:59 CDT
Received: from NDSUVM1 by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id 3559;
Mon, 07 May 90 16:55:59 CDT
Received: from math.mit.edu by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with TCP;
Mon, 07 May 90 16:55:53 CDT
Received: from turing.mit.edu by math.mit.edu; Mon, 7 May 90 17:56:43 EDT
Received: by turing.mit.edu; Mon, 7 May 90 17:56:39 EDT
Date: Mon, 7 May 90 17:56:39 EDT
From: ftl@math.mit.edu (Tom Leighton)
Message-Id: <9005072156.AA13726@turing.mit.edu>
Subject: SPAA Registration Deadline
Resent-To: theory-a@vm1.nodak.edu
Resent-Date: Wed, 09 May 90 14:02:06 -0400
Resent-From: theorynt
The deadline for conference and hotel registration for the 1990 SPAA conference
is May 15. Rates go up after that date and rooms may not be available. This is
the high tourist season in Crete.
∂09-May-90 1634 LOGMTC-mailer MSRI Workshop Announcement: May 14-18
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 9 May 90 16:34:04 PDT
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA25799; Wed, 9 May 90 16:33:44 PDT
Received: by msri.org (4.0/SMI-4.0)
id AA04926; Wed, 9 May 90 16:30:15 PDT
Date: Wed, 9 May 90 16:30:15 PDT
From: david@msri.org (David Mostardi)
Message-Id: <9005092330.AA04926@msri.org>
To: weekly@msri.org
Subject: MSRI Workshop Announcement: May 14-18
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE, BERKELEY, CA 94720 * (415) 642-0143
Schedule for the Workshop on K-Theory, May 14 - 18, 1990
TIME
MON TUES WED THURS FRIDAY
9:30-10:30 Bloch Madsen Carlsson Thomason Tsygan
10:30-11:00 BREAK BREAK BREAK BREAK BREAK
11:00-12:00 Mitchell Loday Karoubi Goodwillie Block
12:00 - 2:15 LUNCH LUNCH LUNCH LUNCH LUNCH
1:00 - 2:00 Baum Baum
2:15 - 3:15 Igusa Wodzicki Bass Macpherson Ogle
3:15 - 4:00 TEA TEA TEA TEA TEA
4:00 - 5:00 Dwyer L. Jones Weiss Suslin
6:30 p.m. - There will be Wine and Cheese , Wednesday, Heyns Room, Faculty Club
Speakers and Titles
Bass: "Non-commutative Characteristic Polynomials"
Baum: "Elliptic Operators and K-Theory for Discrete Groups" I and II
Bloch: "K-Theory, Cycles, and Motives"
Block: "Equivariant and Bivariant K-Theory"
Carlsson: "Applications of Bounded K-Theory"
Dwyer: "Cohomology of BGL(Z) and the Quillen-Lichtenbaum Conjecture"
Goodwillie: "Relative K-Theory"
Igusa: "Parametrised Morse Theory"
L. Jones: "K-Theory of Non-positively Curved Manifolds"
Karoubi: "Characteristic Classes in Number Theory"
Loday: "Eulerian Idempotents, Homology, and the Exponential Map"
Macpherson: "K-Theory and Motives"
Madsen: "Cyclotomic Trace and the Algebraic K-Theory of Spaces"
Mitchell: "Harmonic Localization and the Lichtenbaum-Quillen Conjectures"
Ogle: "A Comment on the Novikov Conjecture: Reduction to One Example"
Suslin: "To Be Announced"
Thomason: "The Localization Theorem and the K-Theory of Schemes"
Tsygan: "Local Rieman-Roch Theorem and Lie Algebra Cohomology"
Weiss: "K-Theory Methods in the Study of Homotopy Spheres"
Wodzicki: "Morita Invariance of Cyclic Homology"
______________________________________________________________________________________
Lunch Seminars
RECURSION THEORY 12:30 MSRI Lecture Hall
S. Kautz "n-Random and Weakly n-Random Sets"
RECURSION THEORY 12:30 MSRI Lecture Hall
J. Remmel "Polynomial Time vs. Recursive Algebra"
∂09-May-90 1641 napier@Sunburn.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 16:40:56 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18430; Wed, 9 May 90 16:19:50 -0700
Date: Wed, 9 May 1990 16:19:45 PDT
From: "Rosemary F. Napier" <napier@Sunburn.Stanford.EDU>
To: students@Sunburn.Stanford.EDU, staff@Sunburn.Stanford.EDU,
Bhayes-roth@SUMEX-AIM.Stanford.EDU, CAB@Sail.Stanford.EDU,
Cooper@SUMEX-AIM.Stanford.EDU, DCL@anna.Stanford.EDU,
EJM@sierra.Stanford.EDU, Engelmore@SUMEX-AIM.Stanford.EDU,
Fagan@SUMEX-AIM.Stanford.EDU, Hartfield@CSLI.Stanford.EDU,
Hayes.pa@XEROX.COM, Helen@CSLI.Stanford.EDU, KAY@CSLI.Stanford.EDU,
Lantz@orc.olivetti.com, Linton@Amadeus.Stanford.EDU,
M@SIERRA.Stanford.EDU, Marty@CIS.Stanford.EDU, Miller@kl.sri.com,
OK@coyote.Stanford.EDU, Oliger@Pride.Stanford.EDU,
Owicki@decwrl.dec.com, Plotkin@troll.Stanford.EDU,
RPG@Sail.Stanford.EDU, Rindfleisch@SUMEX-AIM.Stanford.EDU,
Tobagi@sierra.Stanford.EDU, ZM@sail.Stanford.EDU,
sloan@Sunburn.Stanford.EDU, tom@Sunburn.Stanford.EDU,
ag@pepper.Stanford.EDU, als@sail.Stanford.EDU, andre@csli.Stanford.EDU,
ango@hudson.Stanford.EDU, ark@sail.Stanford.EDU,
baskett%forest.sgi.com@sgi.sgi.com, bergman@cs.Stanford.EDU,
binford@Coyote.Stanford.EDU, bureaucrats@neon.Stanford.EDU,
ceri@eclipse.Stanford.EDU, chandler@cs.Stanford.EDU,
cheriton@Pescadero.Stanford.EDU, chou@Sunburn.Stanford.EDU,
cleron@sunburn.Stanford.EDU, d.dragonofdarkness@Macbeth.Stanford.EDU,
daniel@mojave.Stanford.EDU, de2smith@rpal.com, dewerk@cs.Stanford.EDU,
dill@amadeus.Stanford.EDU, eaf@sumex-aim.Stanford.EDU,
ehs@SUMEX-AIM.Stanford.EDU, fisher@sunburn.Stanford.EDU,
g.gorin@macbeth.Stanford.EDU, ginsberg@sunburn.Stanford.EDU,
gio@SUMEX-AIM.Stanford.EDU, golub@patience.Stanford.EDU,
gotelli@Sunburn.Stanford.EDU, gruber@sumex-aim.Stanford.EDU,
guibas@src.dec.com, halpern@IBM.COM, heck@sunburn.Stanford.EDU,
hemenway@sunburn.Stanford.EDU, herriot@patience.Stanford.EDU,
hf.gls@forsythe.Stanford.EDU, horowitz@amadeus.Stanford.EDU,
j.j1066@Macbeth.Stanford.EDU, jcm@iswim.Stanford.EDU, jle@cs.cmu,
jlh@amadeus.Stanford.EDU, jmc-lists@sail.Stanford.EDU,
jones@sunburn.Stanford.EDU, jutta@cs.Stanford.EDU,
kolk@Jessica.Stanford.EDU, koza@sunburn.Stanford.EDU,
lam@mojave.Stanford.EDU, latombe@coyote.Stanford.EDU,
lenat@sumex-aim.Stanford.EDU, lm@sun.com,
mayr@vax1.rz.uni-frankfurt.dbp.de, meng@tilden.Stanford.EDU,
mis@Psych.Stanford.EDU, mrg@sunburn.Stanford.EDU,
musen@SUMEX-AIM.Stanford.EDU, nanni@mojave.Stanford.EDU,
nii@sumex-aim.Stanford.EDU, pereyra@beauty.Stanford.EDU,
pollock@cs.Stanford.EDU, pratt@jeeves.Stanford.EDU,
psz@sumex-aim.Stanford.EDU, purcell@neon.Stanford.EDU,
rajeev@sunburn.Stanford.EDU, reid@glacier.Stanford.EDU,
rosenberg%hplsr@hplabs.hp.com, rwf@sail.Stanford.EDU,
sagiv@nimbin.Stanford.EDU, shoham@hudson.Stanford.EDU, stan@teleos.com,
stefik.pa@xerox.com, stuart@sunburn.Stanford.EDU,
tajnai@cs.Stanford.EDU, terry.pa@xerox.com, ullman@nimbin.Stanford.EDU,
ungar@thoreau.Stanford.EDU, val@sail.Stanford.EDU, vardi@IBM.COM,
waldinger@ai.sri.com, wheaton@cs.Stanford.EDU,
winograd@loire.Stanford.EDU
Message-Id: <CMM.0.88.642295185.napier@Sunburn.Stanford.EDU>
TO: CSD Faculty, Staff, Students
FROM: Rosemary Napier
RE: going-away card for Nils
Please stop by my office, MJH 340, and sign the card for Nils,
(also available at the "bash" on June 5).
∂09-May-90 1646 chandler@Sunburn.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 16:46:06 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18776; Wed, 9 May 90 16:27:57 -0700
Date: Wed, 9 May 1990 16:27:50 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: "Rosemary F. Napier" <napier@Sunburn.Stanford.EDU>
Cc: students@Sunburn.Stanford.EDU, staff@Sunburn.Stanford.EDU,
Bhayes-roth@SUMEX-AIM.Stanford.EDU, CAB@Sail.Stanford.EDU,
Cooper@SUMEX-AIM.Stanford.EDU, DCL@anna.Stanford.EDU,
EJM@sierra.Stanford.EDU, Engelmore@SUMEX-AIM.Stanford.EDU,
Fagan@SUMEX-AIM.Stanford.EDU, Hartfield@CSLI.Stanford.EDU,
Hayes.pa@XEROX.COM, Helen@CSLI.Stanford.EDU, KAY@CSLI.Stanford.EDU,
Lantz@orc.olivetti.com, Linton@Amadeus.Stanford.EDU,
M@SIERRA.Stanford.EDU, Marty@CIS.Stanford.EDU, Miller@kl.sri.com,
OK@coyote.Stanford.EDU, Oliger@Pride.Stanford.EDU,
Owicki@decwrl.dec.com, Plotkin@troll.Stanford.EDU,
RPG@Sail.Stanford.EDU, Rindfleisch@SUMEX-AIM.Stanford.EDU,
Tobagi@sierra.Stanford.EDU, ZM@sail.Stanford.EDU,
sloan@Sunburn.Stanford.EDU, tom@Sunburn.Stanford.EDU,
ag@pepper.Stanford.EDU, als@sail.Stanford.EDU, andre@csli.Stanford.EDU,
ango@hudson.Stanford.EDU, ark@sail.Stanford.EDU,
baskett%forest.sgi.com@sgi.sgi.com, bergman@cs.Stanford.EDU,
binford@Coyote.Stanford.EDU, bureaucrats@neon.Stanford.EDU,
ceri@eclipse.Stanford.EDU, chandler@cs.Stanford.EDU,
cheriton@Pescadero.Stanford.EDU, chou@Sunburn.Stanford.EDU,
cleron@sunburn.Stanford.EDU, d.dragonofdarkness@Macbeth.Stanford.EDU,
daniel@mojave.Stanford.EDU, de2smith@rpal.com, dewerk@cs.Stanford.EDU,
dill@amadeus.Stanford.EDU, eaf@sumex-aim.Stanford.EDU,
ehs@SUMEX-AIM.Stanford.EDU, fisher@sunburn.Stanford.EDU,
g.gorin@macbeth.Stanford.EDU, ginsberg@sunburn.Stanford.EDU,
gio@SUMEX-AIM.Stanford.EDU, golub@patience.Stanford.EDU,
gotelli@Sunburn.Stanford.EDU, gruber@sumex-aim.Stanford.EDU,
guibas@src.dec.com, halpern@IBM.COM, heck@sunburn.Stanford.EDU,
hemenway@sunburn.Stanford.EDU, herriot@patience.Stanford.EDU,
hf.gls@forsythe.Stanford.EDU, horowitz@amadeus.Stanford.EDU,
j.j1066@Macbeth.Stanford.EDU, jcm@iswim.Stanford.EDU, jle@cs.cmu,
jlh@amadeus.Stanford.EDU, jmc-lists@sail.Stanford.EDU,
jones@sunburn.Stanford.EDU, jutta@cs.Stanford.EDU,
kolk@Jessica.Stanford.EDU, koza@sunburn.Stanford.EDU,
lam@mojave.Stanford.EDU, latombe@coyote.Stanford.EDU,
lenat@sumex-aim.Stanford.EDU, lm@sun.com,
mayr@vax1.rz.uni-frankfurt.dbp.de, meng@tilden.Stanford.EDU,
mis@Psych.Stanford.EDU, mrg@sunburn.Stanford.EDU,
musen@SUMEX-AIM.Stanford.EDU, nanni@mojave.Stanford.EDU,
nii@sumex-aim.Stanford.EDU, pereyra@beauty.Stanford.EDU,
pollock@cs.Stanford.EDU, pratt@jeeves.Stanford.EDU,
psz@sumex-aim.Stanford.EDU, purcell@neon.Stanford.EDU,
rajeev@sunburn.Stanford.EDU, reid@glacier.Stanford.EDU,
rosenberg%hplsr@hplabs.hp.com, rwf@sail.Stanford.EDU, sagiv@nimbin.St
In-Reply-To: Your message of Wed, 9 May 1990 16:19:45 PDT
Message-Id: <CMM.0.88.642295670.chandler@Sunburn.Stanford.EDU>
Just to let you know invitations will be forthcoming for a going-away
reception for Nils on June 5. Please do come by and sign the card.....it's
not a "card" in the traditional sense and will be terrific if you all come by
and add a few words to it.
∂09-May-90 1704 wheaton@Sunburn.Stanford.EDU [HF.KSD@Forsythe.Stanford.EDU: Hearing on Parking and Transportation]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 17:03:59 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20486; Wed, 9 May 90 17:04:05 -0700
Date: Wed, 9 May 90 17:04:05 -0700
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9005100004.AA20486@Sunburn.Stanford.EDU>
To: csd@cs.Stanford.EDU, faculty@cs.Stanford.EDU, staff@cs.Stanford.EDU
Subject: [HF.KSD@Forsythe.Stanford.EDU: Hearing on Parking and Transportation]
Return-Path: <HF.KSD@Forsythe.Stanford.EDU>
Date: Wed, 9 May 90 14:13:21 PDT
To: wheaton@CS.Stanford.EDU
From: "Ken Down" <HF.KSD@Forsythe.Stanford.EDU>
Subject: Hearing on Parking and Transportation
Dear Colleagues,
Please remind your faculty and staff that the Committee on Parking
and Transportation has scheduled a Hearing for Engineering on
Thursday, May 10th, from 12:00 to 1:00 pm in Terman Auditorium.
This is a chance to be heard on Parking issues dear to our hearts.
I hope the hearing will be well attended.
Ken Down
To: XCOMX@SIERRA, DEPTCONT(CARILLI@SIERRA,DIETRICH@SIERRA,DISKIN@KRAKATOA,
GERLACH@SIERRA,HF.GLS,HF.JJC,HF.RRK,HF.SMS,JC.PAB,NJ.DMS,NK.NMF,
PETERSON@SIERRA,WHEATON@POLYA), RESADM(AS.KCC,AS.KWM,HF.GDR,HF.KXM,
HF.RAD,HF.RRK,NA.BJS,NA.PLP,NA.SEW,NA.XFG)
∂09-May-90 1803 tajnai@Hudson.Stanford.EDU Is anyone working on digital magnetic recording
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 18:03:12 PDT
Received: from Hudson.Stanford.EDU by sierra.Stanford.EDU (4.0/4.7); Wed, 9 May 90 18:03:34 PDT
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA17002; Wed, 9 May 90 18:01:24 -0700
Date: Wed, 9 May 1990 18:01:23 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: ee-faculty@sierra.Stanford.EDU, csl-faculty@sierra.Stanford.EDU
Subject: Is anyone working on digital magnetic recording
Message-Id: <CMM.0.88.642301283.tajnai@Hudson.Stanford.EDU>
At the American Electronics Association R&D Symposium last week, a
gentleman asked me if we are doing research on digital magnetic recording.
If you are, please contact him:
Mr. Harry L. Fransen
Vice President
Advanced Technology
Thin-Film Disk Heads
Applied Magnetics Corporation
75 Robin Hill Road
Goleta, CA 93117
(805) 683-5353
fax: (805) 967-8227
If you have information or a lead, please let me know and I'll pass the
information on.
Thanks much,
Carolyn Tajnai
∂09-May-90 1855 chandler@Sunburn.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 18:55:09 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA18776; Wed, 9 May 90 16:27:57 -0700
Date: Wed, 9 May 1990 16:27:50 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: "Rosemary F. Napier" <napier@Sunburn.Stanford.EDU>
Cc: students@Sunburn.Stanford.EDU, staff@Sunburn.Stanford.EDU,
Bhayes-roth@SUMEX-AIM.Stanford.EDU, CAB@Sail.Stanford.EDU,
Cooper@SUMEX-AIM.Stanford.EDU, DCL@anna.Stanford.EDU,
EJM@sierra.Stanford.EDU, Engelmore@SUMEX-AIM.Stanford.EDU,
Fagan@SUMEX-AIM.Stanford.EDU, Hartfield@CSLI.Stanford.EDU,
Hayes.pa@XEROX.COM, Helen@CSLI.Stanford.EDU, KAY@CSLI.Stanford.EDU,
Lantz@orc.olivetti.com, Linton@Amadeus.Stanford.EDU,
M@SIERRA.Stanford.EDU, Marty@CIS.Stanford.EDU, Miller@kl.sri.com,
OK@coyote.Stanford.EDU, Oliger@Pride.Stanford.EDU,
Owicki@decwrl.dec.com, Plotkin@troll.Stanford.EDU,
RPG@Sail.Stanford.EDU, Rindfleisch@SUMEX-AIM.Stanford.EDU,
Tobagi@sierra.Stanford.EDU, ZM@sail.Stanford.EDU,
sloan@Sunburn.Stanford.EDU, tom@Sunburn.Stanford.EDU,
ag@pepper.Stanford.EDU, als@sail.Stanford.EDU, andre@csli.Stanford.EDU,
ango@hudson.Stanford.EDU, ark@sail.Stanford.EDU,
baskett%forest.sgi.com@sgi.sgi.com, bergman@cs.Stanford.EDU,
binford@Coyote.Stanford.EDU, bureaucrats@neon.Stanford.EDU,
ceri@eclipse.Stanford.EDU, chandler@cs.Stanford.EDU,
cheriton@Pescadero.Stanford.EDU, chou@Sunburn.Stanford.EDU,
cleron@sunburn.Stanford.EDU, d.dragonofdarkness@Macbeth.Stanford.EDU,
daniel@mojave.Stanford.EDU, de2smith@rpal.com, dewerk@cs.Stanford.EDU,
dill@amadeus.Stanford.EDU, eaf@sumex-aim.Stanford.EDU,
ehs@SUMEX-AIM.Stanford.EDU, fisher@sunburn.Stanford.EDU,
g.gorin@macbeth.Stanford.EDU, ginsberg@sunburn.Stanford.EDU,
gio@SUMEX-AIM.Stanford.EDU, golub@patience.Stanford.EDU,
gotelli@Sunburn.Stanford.EDU, gruber@sumex-aim.Stanford.EDU,
guibas@src.dec.com, halpern@IBM.COM, heck@sunburn.Stanford.EDU,
hemenway@sunburn.Stanford.EDU, herriot@patience.Stanford.EDU,
hf.gls@forsythe.Stanford.EDU, horowitz@amadeus.Stanford.EDU,
j.j1066@Macbeth.Stanford.EDU, jcm@iswim.Stanford.EDU, jle@cs.cmu,
jlh@amadeus.Stanford.EDU, jmc-lists@sail.Stanford.EDU,
jones@sunburn.Stanford.EDU, jutta@cs.Stanford.EDU,
kolk@Jessica.Stanford.EDU, koza@sunburn.Stanford.EDU,
lam@mojave.Stanford.EDU, latombe@coyote.Stanford.EDU,
lenat@sumex-aim.Stanford.EDU, lm@sun.com,
mayr@vax1.rz.uni-frankfurt.dbp.de, meng@tilden.Stanford.EDU,
mis@Psych.Stanford.EDU, mrg@sunburn.Stanford.EDU,
musen@SUMEX-AIM.Stanford.EDU, nanni@mojave.Stan
In-Reply-To: Your message of Wed, 9 May 1990 16:19:45 PDT
Message-Id: <CMM.0.88.642295670.chandler@Sunburn.Stanford.EDU>
Just to let you know invitations will be forthcoming for a going-away
reception for Nils on June 5. Please do come by and sign the card.....it's
not a "card" in the traditional sense and will be terrific if you all come by
and add a few words to it.
∂09-May-90 1924 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Hudson.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Structure in Complexity Theory - modified posting
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 9 May 90 19:24:49 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA04646; Wed, 9 May 90 19:17:28 -0700
Received: from Hudson.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12170; Wed, 9 May 90 19:25:22 -0700
Received: from vm1.NoDak.edu by Hudson.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17161; Wed, 9 May 90 19:12:14 -0700
Message-Id: <9005100212.AA17161@Hudson.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7842; Wed, 09 May 90 21:05:40 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.03B) with BSMTP id
7801; Wed, 09 May 90 21:05:34 CDT
Date: Wed, 9 May 90 16:30:22 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Timothy J Long <long@cis.ohio-state.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: theory-a@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Timothy J Long <long%cis.ohio-state.edu@VM1.NoDak.EDU>
Subject: Structure in Complexity Theory - modified posting
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
********************************************************************************
STRUCTURE IN COMPLEXITY THEORY
Fifth Annual Conference
July 7-11, 1990
Universitat Politecnica de Catalunya, Barcelona, Spain
Registration, Conference Information, and Program
NOTE: The program has been modified from the earlier posting on TheoryNet.
*******************************************************************************
ADVANCE REGISTRATION FORM
(Use this form when paying in US dollars.)
Return this form by June 8, 1990. Enclose a check in US$, or international
money order in US$ payable through a US bank, or a Canadian check in
US$, made out to IEEE Structures 1990" to:
Structures c/o Stephen R. Mahaney
Department of Computer Science
Gould-Simpson 721
University of Arizona
Tuscon, AZ 85721 USA
Last name _______________________________ First _______________________________
Affiliation ___________________________________________________________________
Mailing address _______________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
EMail address ________________________________________________________________
Telephone _____________________________________________________________________
Registration fee includes proceedings, reception, lunch Sunday - Wednesday,
early evening refreshments, and banquet.
By June 8 After June 8
IEEE, ACM, SIGACT
or EATCS member $200.00 $250.00
Nonmembers $250.00 $300.00
Students $65.00 $130.00
Conference fee $ _______________________________
Additional banquet tickets at $40.00:
Number: __________________________________ $ __________________________________
Special dietary needs: ________________________________________________________
Room fee from housing registration $ __________________________________________
Additional proceedings at $20.00:
Number: __________________________________ $ ___________________________________
Total enclosed: $ _______________________________
********************************************************************************
*
ADVANCE REGISTRATION FORM
(Use this form when paying in Spanish pesetas.)
Return form by June 8, 1990. Enclose a check in pesetas or an interna-
tional money order in pesetas payable through a Spanish bank, made out
to UPC-IEEE-STRUCTURE-CONFERENCE" to:
Jose L. Balcazar
Department LSI (FIB)
Universitat Politecnica de Catalunya
Pau Gargallo 5
08028 Barcelona, Spain
Last name _______________________________ First _______________________________
Affiliation ___________________________________________________________________
Mailing address _______________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
EMail address_________________________________________________________________
Telephone _____________________________________________________________________
Registration fee includes proceedings, reception, lunch Sunday - Wednesday,
early evening refreshments, and banquet.
By June 8 After June 8
IEEE, ACM, SIGACT
or EATCS member 22000 ptas 27500 ptas
Nonmembers 27500 ptas 33000 ptas
Students 7150 ptas 14300 ptas
Conference fee ______________________________ptas
Additional banquet tickets at 4400 ptas:
Number: _______________________________ & _________________________________ptas
Special dietary needs: ________________________________________________________
Room fee from housing registration ________________________________________ptas
Additional proceedings at 2200 ptas:
Number: _______________________________ & _________________________________ptas
Total enclosed: _____________________________ptas
********************************************************************************
HOUSING REGISTRATION
Residencia S. Raimon de Penyafort Accomodations
Fees include breakfast.
Single 2500 ptas/night or $23.00/night
Double 2200 ptas/night or $20.00/night
Check-in date _________________________________________________________________
Check-out date _______________________________________________________________
Number of nights _____________________________________________________________
If sharing a double room, with whom?
_______________________________________________________________________________
Hotel Wilson Accomodations
Fees include breakfast and are for the 5 nights Saturday-Wednesday.
Single 4800 ptas/night or $44.00/night
Double 3500 ptas/night or $32.00/night
Total 5 night fee for Hotel Wilson is:
Single 24000 ptas or $220.00
Double 17500 ptas or $160.00
If sharing a double room, with whom?
_______________________________________________________________________________
Room fee enclosed _____________________________________________________________
*******************************************************************************
CONFERENCE INFORMATION
LOCATION: Barcelona, Spain
Barcelona is a city of about 3 million people located on Spain's Mediter-
ranean shore. It has been called "a northern city of the south"; modern and
industrial, but at the same time Mediterranean, rich in culture and tradi-
tions, and having a pleasant climate. Barcelona is close to both mountains
and mediterranian beaches.
Founded by the Romans, Barcelona has long been a center of sciences and
arts. Fine Romanesque art and architecture, from the middle ages, can be
found in Barcelona and surrounding Catalonia. At the turn of the century,
Barcelona was a great center of art nouveau. Among its many contribu-
tors to the arts, the names of Gaudi, Picasso, Gris, Dali, Miro, or Tapies
have gained universal respect, and their works can be admired in the local
museums and the streets of the city. Barcelona is a vibrant, pulsating city
offering a wide cultural life, many shopping areas, and a great variety of
restaurants. The city will host the 1992 Olympic Games.
BARCELONA CLIMATE:
Typical July weather is hot and humid, ranging from 21o C (70o F) to 35o
C (95o F). Rain is not likely.
HOUSING:
Reservations for up to 40 attendees each have been made in student housing
and in two hotels. Advance registration forms are provided for the student
housing and the Hotel Wilson, subject to the 40 person limit. Reservations
with the Hotel Numancia must be made by contacting the hotel directly. Be
sure to mention the Structure in Complexity Theory conference to get the
conference discounted rates. Every attempt will be made to accomodate
late registrants, but rooms and rates cannot be guaranteed.
Note: Quoted housing prices are guaranteed in pesetas, but not in dollars.
Prices in the forms have been determined at 1 US$ = 110 pesetas. In the
event that the US$ weakens significantly, attendees who prepay lodging in
US$ will be required to make up the difference. (In the last 8 years, the
US$ has not been weaker than approximately 1 US$ = 108 pesetas, so this
is unlikely.) Those wanting to avoid this risk should register in advance to
Barcelona.
Residencia S. Raimon de Penyafort:
Address: Av. Diagonal, 643, 08028 Barcelona; Ph: (3) 330 8711; rates
per person: single room 2500 pts./night, double 2200 pts./night. This is
a student residence with separate living areas for men and women. It is
very close to the conference area (5 minute walk), and does not have air-
conditioning. Breakfast is included in the price. Free parking.
Hotel Wilson:
Address: Av. Diagonal, 568, 08021 Barcelona; Ph: (3) 209 2511; rates
per person: single room 4800 pts./night, double 3500 pts./night. These
prices are only applicable if the rooms are reserved for the five nights from
Saturday-Wednesday. Air-conditioned. The conference area can be reached
in 10 minutes by public bus (bus line 7). Cribs are available and breakfast
is included in the price. No free parking.
Hotel Numancia:
Address: Numancia, 74, 08029 Barcelona; Ph: (3) 322 4451; rates per per-
son: single room 7700 pts./ night, double 5300 pts./night. Air-conditioned.
The hotel is a 5 minute walk from the Barcelona Central Railway Station
(Sants) and three subway stops away from the conference area. Probably
the best choice for attendees traveling with children. A third bed costs
3000 pts; cribs are free. Breakfast is not included. Free parking.
RECEPTION:
The welcoming reception will take place Saturday, July 7, from 7 to 10 p.m.
at the Catedra Gaudi, a small and beautiful building (designed by Gaudi, of
course) that is part of the Barcelona Universities. The address is Avenida
de Pedralbes at Manuel Girona. From the Hotel Wilson, take bus line 7
from the front door, head towards Zona Universitaria until seeing the large
hotel Princesa Sofia on your left. The Avenida de Pedralbes starts there;
walk uphill. The Catedra Gaudi is located on the first left corner. From the
Hotel Numancia, take the subway at Placa del Centre towards Zona Uni-
versitaria to the Palau Reial stop, walk towards the Hotel Princesa Sofia,
following the directions as above. The residence S. Raimon de Penyafort
is adjacent to the Hotel Princesa Sofia. Cross the Avenida Diagonal at the
traffic lights and walk uphill as indicated above.
CONFERENCE LOCATION:
Conference talks will take place in the Aula Capilla of the School of Indus-
trial Engineering of the Universitat Politecnica de Catalunya, located in
the southwest part of Barcelona at Avenida Diagonal 647. The conference
area is easily reachable either by subway (green line, stop Palau Reial) or
by bus (line 7). Registration includes lunches that will be served in the
cafeteria of the school. Vegetarian food will be available, and an effort will
be made to provide kosher food for both the lunches and the banquet. The
conference room is air-conditioned.
BANQUET:
The banquet will be Tuesday evening, July 10, at 9 pm. It will be held at a
traditional Catalonian open air restaurant, where interesting and enjoyable
mediterranian food is served. A fine selection of famous Catalonian wines
will be available. The restaurant is located in the gardens of a picturesque
area of Barcelona called \El poble espanyol", the Spanish village. This
entertaining area consists of a small village of houses representing the dif-
ferent architectural styles that can be found throughout Spain. Besides its
interesting buildings, walls, and streets, the village has many types of live
music, ranging from Spanish folk to Jazz or Music-hall, all concentrated in
a small area that can be visited after dinner. Additional banquet tickets
are available.
GETTING THERE
Barcelona is served by all major European Airlines, including Iberia, KLM,
British Airways, Lufthansa, and many others. These airlines can be used for
overseas flights to Barcelona directly or connect through Madrid, Amster-
dam, London, and Frankfurt. TWA and PanAm fly directly into Barcelona
from the USA.
The airport, Barcelona El Prat, is located about 7 km (about 5 miles) south
of Barcelona. Every half hour, a train, costing 150 pesetas, runs between
the airport and Barcelona Sants Central Station, the main railway station
where all trains stop. The cost of a taxi between the airport and the city
is about 1500 pts. Major car rental companies have offices at the airport;
driving from the airport into the city is easy.
!From Barcelona Sants Central Station, Hotel Numancia is a 5 minute walk;
just follow Numancia street from the station. To reach the Hotel Wilson
from the central station, take bus 27 to the stop at Diagonal street. To
reach the student residence and conference location from the station, take
the green line of the subway towards Zona Universitaria, stop at Palau
Reial.
MESSAGES AND ADDITIONAL INFORMATION
In the event that you need to be contacted at the conference, messages
can be left at (3) 401 6994 and at (3) 401 7000. Further questions can be
addressed by email to
Jose Balcazar at balqui@lsi.upc.es
Jacobo Toran at jacobo@lsi.upc.es
Stephen Mahaney at srm@cs.arizona.edu
ACKNOWLEDGEMENTS
The Program Committee consisted of Laszlo Babai, Josep Diaz, Dexter
Kozen, Alan L. Selman, chair, Peter Clote, Stuart Kurtz, Gerd Wechsung,
Steven Homer, and Walter L. Ruzzo. The conference committee consists
of Juris Hartmanis, Tim Long, Stephen Mahaney, chair, Alan Selman, and
Paul Young.
Local Arrangements Chairs:
Jose Balcazar and Jacobo Toran
Department LSI (FIB)
Universitat Politecnica de Catalunya
Pau Gargallo 5
08028 Barcelona, Spain
We gratefully acknowledge the generosity of the Universitat Politecnica de
Catalunya in providing accommodations and a generous grant for students.
Thanks also to Tim Long for producing this brochure and Dan Leivant for
printing and mailing.
PROGRAM
All talks will take place in the Aula Capilla of the School of Industrial
Engineering of the Universitat Politecnica de Catalunya. Informal Rump
Sessions will be scheduled at the end of each day's formal session, and
will be held in the Salon de Actos of the computer science building Facultat
d'Informatica, adjacent to the School of Industrial Engineering.
Registration and Reception : Saturday, July 7
Registration, 7:00-9:00 pm, and reception, 7:00-10:00 pm, in the Catedra
Gaudi.
SESSION 1: Sunday, July 8, Morning
Chair: Alan Selman, Northeastern University
8:45-9:30 On Polynomial Bounded Truth-Table Reducibility of NP Sets
to Sparse Sets, M. Ogiwara and O. Watanabe, Tokyo Institute of Technology
9:40-10:25 Structural Properties of Nondeterministic Complete Sets,
S. Homer, Boston University
10:55-11:25 On Sets with Efficient Implicit Membership Tests, L. Hemachandra,
University of Rochester, A.Hoene, Technische Universitat Berlin
11:30-12:00 On the Instance Complexity of NP-Hard Problems, P. Orponen,
University of Toronto and University of Helsinki
SESSION 2: Sunday, July 8, Afternoon.
Chair: Peter Clote, Boston College
1:30-2:15 Email and the Unexpected Power of Interaction, L. Babai,
University of Chicago and Eotvos University
2:25-2:55 On Bounded Round Multi-Prover Interactive Proof Systems, J.
Cai, R. Lipton, Princeton University, A. Condon, University of Wisconsin-
Madison
3:00-3:30 Privacy, Additional Information, and Communication,
R. Bar-Yehuda, B. Chor, E. Kushilevitz, Technion
4:00-4:30 On the Power of Randomness in the Decision Tree Model, P.
Hajnal, Princeton University and University of Szeged
4:35-5:05 On Read-Once Threshold Formulae and their Randomized
Decision Tree Complexity, R. Heiman, Weizmann Institute, I. Newman, A.
Wigderson, Hebrew University
SESSION 3: Monday, July 9, Morning
Chair: Laszlo Babai, University of Chicago and Eotvos University
8:45-9:30 The Computational Complexity of Universal Hashing, Y. Man-
sour, N. Nisan, M.I.T., P. Tiwari, IBM T.J. Watson Research Center
9:40-10:25 Perfect Hashing, Graph Entropy, and Circuit Complexity, I.
Newman, A. Wigderson, Hebrew University, P. Ragde, University of Waterloo
10:55-11:25 Lower Bounds on Random-Self-Reducibility, J. Feigenbaum,
AT&T Bell Laboratories, S. Kannan, University of California-Berkeley, N.
Nisan, M.I.T.
11:30-12:00 Non-Uniform Complexity Classes and Random Languages, M.
Mundhenk, Universitat Ulm, R. Schuler, U. Koblenz
SESSION 4: Monday, July 8, Afternoon
Chair: Stuart Kurtz, University of Chicago
1:30-2:00 Width-Bounded Reducibility and Binary Search over Complexity
Classes, E. Allender, Rutgers University, C. Wilson, University of Oregon
2:05-2:35 Unambiguity of Circuits, K. Lange,
Technische Universitat Muchen
3:05-4:00 Panel Discussion: Current Trends in Complexity Theory
7 pm. Business meeting in Salon de Actos of the computer science
building, Facultat d'Informatica.
SESSION 5: Tuesday, July 10, Morning
Chair: Josep Diaz, Universitat Politecnica de Catalunya
8:45-9:30 A Survey of Counting Classes, G. Wechsung, Friedrich-Schiller
Universitat
9:40-10:25 A Very Hard Log Space Counting Class, C. Alvarez, Universitat
Politecnica de Catalunya, B. Jenner, Universitat Hamburg
10:55-11:25 The Boolean Hierarchy and the Polynomial Hierarchy: A
Closer Connection, R. Chang, Cornell University, J. Kadin, University of
Maine
11:30-12:00 On Read-Once vs. Multiple Access to Randomness in Logspace,
N. Nisan, M.I.T.
SESSION 6: Tuesday, July 10, Afternoon
Chair: Gerd Wechsung, Friedrich-Schiller Universitat
1:30-2:15 Bounded Arithmetic and Complexity, P. Clote, Boston College
2:25-2:55 Extensions to Barrington's M-Program Model, F. Bedard, F.
Lemieux, P. McKenzie, Universite de Montreal
3:00-3:30 The Quantifier Structure of Sentences that Characterize Non-
deterministic Time Complexity, J. Lynch, Clarkson University
4:00-4:30 Circuits, Pebbling, and Expressibility, E. Vinay, C. Madhaven,
Indian Institute of Science, H. Venkateswaran, Georgia Institute of Tech-
nology
9 pm. Banquet at a Catalonian restaurant.
SESSION 7: Wednesday, July 11, Morning
Chair: Dexter Kozen, Cornell University
8:45-9:30 Some Connections between Bounded Query Classes and Non-
Uniform complexity, A. Amir, W. Gasarch, University of Maryland, R.
Beigel, Yale University
9:40-10:25 Quantifiers and Approximation, A. Panconesi, D. Ranjan,
Cornell University
10:55-11:25 Impossibilities and Possibilities of Weak Separation Between
NP and Exponential Time, G. Lischke, Friedrich-Schiller Universitat
11:30-12:00 P-Productivity and Polynomial Time Approximations, J.
Wang, Boston University
SESSION 8: Wednesday, July 11, Afternoon
Chair: Steven Homer, Boston University
1:30-2:15 Circuit Size Relative to Pseudorandom Oracles, J. Lutz, W.
Schmidt, Iowa State University
2:25-2:55 A Note on Relativizing Complexity Classes with Tally Oracles,
L. Hemachandra, University of Rochester, R. Rubinstein, Worcester Poly-
technic Institute
3:00-3:00 An Oracle Separating Parity-P from PP(PH), F. Green,
Clark University
4:00-4:30 On Separating Complexity Classes, R. Book,
University of California-Santa Barbara
4:30-5:05 Complexity Classes with Advice, J. Kobler, T. Thierauf,
Universitat Ulm
∂10-May-90 0806 chandler@Sunburn.Stanford.EDU Next Week's Facuty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 May 90 08:06:50 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07071; Thu, 10 May 90 08:07:09 -0700
Date: Thu, 10 May 1990 8:07:09 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, bureaucrats@Sunburn.Stanford.EDU,
staff-rep@Sunburn.Stanford.EDU, stefik@Sunburn.Stanford.EDU,
psz@sumex-aim.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Cc: chandler@Sunburn.Stanford.EDU
Subject: Next Week's Facuty Lunch
Message-Id: <CMM.0.88.642352029.chandler@Sunburn.Stanford.EDU>
Just a reminder to let you know that our guest for next week's faculty lunch
(5/15 12:15 in MJH-220) will be Noe Lozano. Noe is the Associate Dean for
Student Affairs in the School of Engineering and will talk to us about
minority recruitment/retention for engineering students.
∂10-May-90 1649 stager@Sunburn.Stanford.EDU Projection Rooms (1990-91)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 10 May 90 16:48:56 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA21740; Thu, 10 May 90 16:48:56 -0700
Date: Thu, 10 May 1990 16:48:55 PDT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Cc: stager@Sunburn.Stanford.EDU
Subject: Projection Rooms (1990-91)
Message-Id: <CMM.0.88.642383335.stager@Sunburn.Stanford.EDU>
If you're teaching a non-televised CS course during 1990/91, and would be
interested in having it meet in one of the two large (one can hold 300, the
other 175) projection rooms we've equipped over in the Psychology building,
please let me know. The rooms are 420-040, and 420-041. Many time slots
have been filled by our intro courses, and by the Psychology Dept.,
but some slots are still available.
Let me know by the beginning of next week if you'd like to meet in one
of the two rooms, and I'll try to reserve a slot for you.
Thanks.
Claire
∂11-May-90 1022 NA.JAN@Forsythe.Stanford.EDU Salary Setting
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 May 90 10:22:33 PDT
Received: from Forsythe.Stanford.EDU by sierra.Stanford.EDU (4.0/4.7); Fri, 11 May 90 10:21:32 PDT
Date: Fri, 11 May 90 10:22:18 PDT
To: ee-faculty@sierra
From: "Janice Simpson" <NA.JAN@Forsythe.Stanford.EDU>
Subject: Salary Setting
To: Electrical Engineering Faculty
From: Kathy Davis
Date: May 11, 1990
Subj: Salary Setting
I'm writing to inform you that the staff salary setting process is
now going on. Each of the Lab Directors are being given the salary
setting guidelines and salary comparison information for non-exempt
staff, exempt staff and research associates. The recommendations
are due back to my office June 1, 1990.
I have asked the Lab Directors to utilize the completed performance
appraisals in making their determinations. Your timely completion
and submission of this appraisal is critical to the process. If you
have concerns, questions or issues to raise regarding the 1989-90
salaries, now is the time to speak with your lab director.
cc: J. Goodman
J. Jezukewicz
To: EE-FACULTY@SIERRA, JEZUKEWICZ@SIERRA
∂11-May-90 1047 ingrid@russell.Stanford.EDU Syntax Workshop, Tuesday, 15 May, 7:30 p.m.
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 May 90 10:47:16 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA25595; Fri, 11 May 90 10:27:10 PDT
Date: Fri, 11 May 90 10:27:10 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005111727.AA25595@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Syntax Workshop, Tuesday, 15 May, 7:30 p.m.
SYNTAX WORKSHOP
Linking Theory in Role and Reference Grammar
Robert Van Valin
University of California, Davis
Tuesday, 15 May, 7:30 p.m.
Cordura 100
Role and Reference Grammar [RRG] posits only a single level of
syntactic representation, and therefore the syntactic representation
of a sentence must be linked directly to its semantic representation
without any mediating abstract levels of representation. In this
talk, I will outline how this linking works in RRG, focusing on the
theories of lexical representation, thematic relations, and semantic
macroroles, and on problems such as syntactically ergative languages
and inverse constructions.
The final workshop of the quarter will be Tuesday, 29 May. Carol
Neidle will be the speaker.
∂11-May-90 1554 @Sunburn.Stanford.EDU:ullman@nimbin.Stanford.EDU Guggenheim fellowships
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 May 90 15:54:49 PDT
Received: from nimbin.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12370; Fri, 11 May 90 15:54:26 -0700
Received: by nimbin.Stanford.EDU (5.61 built Aug 15 1989 on wolvesden.stanford.edu/inc-1.01)
id AA22212; Fri, 11 May 90 15:54:04 -0700
Date: Fri, 11 May 90 15:54:04 -0700
From: Jeffrey D. Ullman <ullman@nimbin.Stanford.EDU>
Message-Id: <9005112254.AA22212@nimbin.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Guggenheim fellowships
I want to draw attention to the Guggenheim fellowship process for those
who have never received one. The deadline for applications is Oct. 1, 1990,
with selection in March, presumably for academic year 1991-92.
If you are planning a sabbatical, you should take a shot. They tend not
to give much to science and engineering types, but they'll give you
something. It also *forces* you to take a sabbatical; usually,
GUggenheim fellows travel, although I don't think it is a de facto requirement.
The general idea is that you need to identify a project of about 1 year
duration. If possible, tie it in with the place you intend to go and/or
the people you intend to work with. You'll need four references from
people familiar with your work, especially as it pertains to the proposed
project.
You can get an application by writing to
John Simon Guggenheim Memorial Foundation
90 Park Ave.
New York, NY 10016
---jdu
∂11-May-90 1646 grundy@csli.Stanford.EDU Symbolic Systems Forum, May 17
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 May 90 16:46:36 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA07587; Fri, 11 May 90 16:35:13 PDT
Date: Fri 11 May 90 16:35:11-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum, May 17
To: grundy@csli.Stanford.EDU
Message-Id: <642468911.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, May 17, 1990
Building 60, Room 61-G, 4:15 pm
Speaker: Jean-Pierre Dupuy
Topic: "On the Self-Deconstruction of the Symbolic Order"
ABSTRACT
--------
Are French and American philosophies doomed to ignore
each other forever? The notion of the "symbolic system"
might provide a ground on which to test the possibilities of
cross-fertilization between French thought and analytic
philosophy. I will focus on an aspect of symbolic forms
(e.g., social conventions and institutions) that is rarely
discussed: the fact that they are moral, earmarked for
decomposition and, ultimately, for destruction.
Among the topics I may broach in this perspective are
the following: the meaning of a text, the nature of
literary conventions and the liar's paradox; social
hierarchies in religious societies and rituals of the
carnival type; the paradox of self-amendment in the
philosophy of law; the logic of Derridian deconstructions;
the notion of "reputation" in the reflections on the
foundations of game theory; the paradox of backward
induction; the concept of "convention" in the works of
D. K. Lewis and J. M. Keynes.
Next week, May 24:
Rene Girard
"The Genesis of Symbolic Forms in Human Culture"
Note to bboard readers:
If you would like to receive Symbolic Systems Forum
mailings directly, please send a note to Bill Grundy
(grundy@csli).
-------
∂12-May-90 1534 axwang@Theory.Stanford.EDU No AFLB this week
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 May 90 15:34:16 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA07815; Sat, 12 May 90 15:21:01 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA15651; Sat, 12 May 90 15:28:13 -0700
Message-Id: <9005122228.AA15651@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: No AFLB this week
Date: Sat, 12 May 90 15:28:10 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
Because of STOC, there will be no AFLB seminar this week.
∂13-May-90 2215 LOGMTC-mailer [Sol Feferman <sf@csli.Stanford.EDU> : Seminar in Logic and
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 May 90 22:15:18 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04787; Sun, 13 May 90 22:16:18 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA27951; Sun, 13 May 90 22:17:43 PDT
Date: Sun, 13 May 1990 22:17:41 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: [Sol Feferman <sf@csli.Stanford.EDU> : Seminar in Logic and
Foundations ]
Message-Id: <CMM.0.88.642662261.sf@csli.stanford.edu>
Reminder of van Lambalgen's seminar talk Monday May 14. There will be a
dinner out with the speaker following the talk.
---------------
Return-Path: <LOGMTC-mailer@SAIL.Stanford.EDU>
Received: from SAIL.Stanford.EDU by csli.Stanford.EDU (4.1/inc-1.0)
id AA16332; Tue, 8 May 90 16:16:33 PDT
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 May 90 16:05:35 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20517; Tue, 8 May 90 16:06:35 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA15984; Tue, 8 May 90 16:07:48 PDT
Date: Tue, 8 May 1990 16:07:41 PDT
>From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.642208061.sf@csli.stanford.edu>
Speaker: Dr. Michiel van Lambalgen, Univ. of Amsterdam and MSRI
Title: On so-called "information theoretic incompleteness theorems"
Time: Monday May 14, 4:15-5:30 PM
Place: Room 381-T, first floor, Math Corner, Stanford
Abstract:
In the first part of the talk we shall present a critical examination of
Chaitin's version (using Kolmogorov complexity) of the first incompleteness
theorem. In the second part we relate this version to a recent proof
of Boolos (Notices AMS, April 1989).
∂14-May-90 1039 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Complex System seminal
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 14 May 90 10:39:53 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Mon, 14 May 90 10:33:29-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Mon, 14 May 90 09:42:00 PDT
Date: Mon, 14 May 90 09:45 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Complex System seminal
To: complex-systems@Warbucks.AI.SRI.COM
Message-ID: <19900514164509.9.BERGMAN@HUXLEY.AI.SRI.COM>
We are pleased to anounce the third in the series of lectures
in the science of complexity:
The Sentient Forager
(The Learning Lizards)
Jonathan Roughgarden
Thursday, May 17 1990, 1:15PM
Room EJ 228
Address: SRI International
333 Ravenswood Ave.
Menlo Park, CA
Jonathan Roughgarden is a Professor of Biological Sciences at Stanford University.
Professor Roughgarden's main research intrest are in mathemetical theoty that
combines population genetics with population ecology, and coevolution.
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
-----------------------------------------------------------------------------------
Send submissions, questions, address maintenance and requests to present talks to
"complex-systems-request@AI.SRI.COM" or Bergman@AI.SRI.COM
- Aviv.
∂14-May-90 1448 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU The last edition of Nils' News
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 May 90 14:48:51 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23180; Mon, 14 May 90 14:46:04 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA08398; Mon, 14 May 90 14:43:37 -0700
Date: Mon, 14 May 1990 14:43:35 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU, staff@cs.Stanford.EDU
Subject: The last edition of Nils' News
Message-Id: <CMM.0.88.642721415.tajnai@Hudson.Stanford.EDU>
Perhaps I should say the "penultimate" edition, but this will probably be
the last.
My goal is to the the letter out by June 1. Please send me news that
you want included, honors you or your students have received, etc.
Target date: Tuesday, May 29 (or sooner).
Carolyn
∂14-May-90 1451 @Sunburn.Stanford.EDU:young@Neon.Stanford.EDU Qual Depth Clarifications
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 May 90 14:51:42 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23960; Mon, 14 May 90 14:52:43 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA02562; Mon, 14 May 90 14:52:34 -0700
Date: Mon, 14 May 1990 14:52:34 PDT
From: "R. Michael Young" <young@Neon.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU
Cc: young@Neon.Stanford.EDU
Subject: Qual Depth Clarifications
Message-Id: <CMM.0.88.642721954.young@Neon.Stanford.EDU>
Professor McCarthy,
Yoav suggested I talk to you about the intended scope of my depth area
in the upcoming AI Qual, for which you're my depth area examiner. In
particular, Yoav was unclear about the depth of knowledge I was
intending to demonstrate relating to nonmonotonic logics, reasoning
about change, and other reasoning and representation issues.
In order to avoid any ambiguity, I would like to come to a common
understanding about the scope of my depth area. Yoav says he thinks
you're about to leave for a trip. Would it be possible for me to meet
with you briefly sometime soon to clarify things?
-Michael
∂14-May-90 1709 ingrid@russell.Stanford.EDU Poetics Workshop Postponed
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 May 90 17:08:54 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA05907; Mon, 14 May 90 16:42:24 PDT
Date: Mon, 14 May 90 16:42:24 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005142342.AA05907@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Poetics Workshop Postponed
POETICS WORKSHOP POSTPONED
The talk by Vycheslav Ivanov originally scheduled for this Tuesday, 15
May, has been postponed for two weeks. Instead it will take place on
Tuesday, 29 May, at the usual time of 4:00 p.m., in Ventura 17. The
subject will be the role of unstressed syllables in the rhythmic
patterns of contemporary Russian verse.
∂15-May-90 0855 napier@Sunburn.Stanford.EDU goodbye for Sharon & Aleta
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 May 90 08:55:43 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10361; Tue, 15 May 90 08:47:09 -0700
Date: Tue, 15 May 1990 8:47:08 PDT
From: "Rosemary F. Napier" <napier@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, phd@Sunburn.Stanford.EDU,
mscs@Sunburn.Stanford.EDU, Margaret@Mojave.Stanford.EDU,
Perrie@SUMEX-AIM.Stanford.EDU, Pollock@sunburn.Stanford.EDU,
Rogers@SUMEX-AIM.Stanford.EDU, Timothy@sumex-aim.Stanford.EDU,
littell@Sunburn.Stanford.EDU, sloan@Sunburn.Stanford.EDU,
tom@Sunburn.Stanford.EDU, albert3@sunburn.Stanford.EDU,
ariadne@eclipse.Stanford.EDU, baldwin@Sunburn.Stanford.EDU,
bergman@cs.Stanford.EDU, bergman@sunburn.Stanford.EDU,
carol@coyote.Stanford.EDU, caroline@eclipse.Stanford.EDU,
chandler@Sunburn.Stanford.EDU, davis@sunburn.Stanford.EDU,
dean@patience.Stanford.EDU, dewerk@cs.Stanford.EDU,
eileen@sierra.Stanford.EDU, gilberts@sunburn.Stanford.EDU,
gotelli@Sunburn.Stanford.EDU, gotelli@cs.Stanford.EDU,
gsmith@SUMEX-AIM.Stanford.EDU, irvine@sumex-aim.Stanford.EDU,
jimenez@sunburn.Stanford.EDU, jones@sunburn.Stanford.EDU,
jutta@cs.Stanford.EDU, jutta@sunburn.Stanford.EDU,
mary@patience.Stanford.EDU, merryman@sunburn.Stanford.EDU,
mps@sail.Stanford.EDU, napier@sunburn.Stanford.EDU,
nevena@pescadero.Stanford.EDU, nilsson@TENAYA.Stanford.EDU,
pollock@cs.Stanford.EDU, prior@hudson.Stanford.EDU,
rlm@cs.Stanford.EDU, siroker@eclipse.Stanford.EDU,
stager@cs.Stanford.EDU, tajnai@cs.Stanford.EDU,
tajnai@hudson.Stanford.EDU, taleen@sunburn.Stanford.EDU,
tcr@SUMEX-AIM.Stanford.EDU, ursula@sunburn.Stanford.EDU,
wheaton@sunburn.Stanford.EDU, winkler@sunburn.Stanford.EDU
Subject: goodbye for Sharon & Aleta
Message-Id: <CMM.0.88.642786428.napier@Sunburn.Stanford.EDU>
TO: Graduate Students, Faculty, Staff
FROM: Rosemary Napier <napier@sunburn>
RE: Sharon Hemenway and Aleta Akhtar
are leaving the dept. soon.
This Wednesday, May 16 at 4pm, is set aside for you
to spend with them. Join us in the Psychology patio
for some wine and cheese and a little traveling music.
∂15-May-90 1135 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Complex System Seminar (reminderom)
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 15 May 90 11:35:45 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Tue, 15 May 90 09:59:04-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Tue, 15 May 90 09:56:33 PDT
Date: Tue, 15 May 90 09:59 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Complex System Seminar (reminderom)
To: complex-systems@Warbucks.AI.SRI.COM
Message-ID: <19900515165948.2.BERGMAN@HUXLEY.AI.SRI.COM>
We are pleased to anounce the third in the series of lectures
in the science of complexity:
Rules of Thumb: An Application of AI to Behavioral Ecology
Jonathan Roughgarden
Thursday, May 17 1990, 1:15PM
Room EJ 228
Address: SRI International
333 Ravenswood Ave.
Menlo Park, CA
Jonathan Roughgarden is a Professor of Biological Sciences at Stanford University.
Professor Roughgarden's main research intrest are in mathemetical theory that
combines population genetics with population ecology, and coevolution.
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
-----------------------------------------------------------------------------------
Send submissions, questions, address maintenance and requests to present talks to
"complex-systems-request@AI.SRI.COM" or Bergman@AI.SRI.COM
- Aviv.
∂15-May-90 1152 gilberts@Sunburn.Stanford.EDU Performance Reviews
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 May 90 11:52:07 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17626; Tue, 15 May 90 11:53:08 -0700
Date: Tue, 15 May 1990 11:53:07 PDT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: CLT@Sail.Stanford.EDU, McCarthy@CS.Stanford.EDU
Cc: Gilbertson@Sunburn.Stanford.EDU
Subject: Performance Reviews
Message-Id: <CMM.0.88.642797587.gilberts@Sunburn.Stanford.EDU>
Carolyn and John,
The performance reviews are due in the Dean's office
and I'm collecting the remaining few. When do you
think you'll have yours ready to be turned in?
Thanks,
-Edie
∂15-May-90 1345 tom@Sunburn.Stanford.EDU [AR.TXA@Forsythe.Stanford.EDU: CHILLED WATER AND STEAM SHUTDOWN ON MEMORIAL DAY WEEKEND]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 May 90 13:45:00 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19912; Tue, 15 May 90 13:28:02 -0700
Date: Tue, 15 May 90 13:28:02 -0700
From: Tom Dienstbier <tom@Sunburn.Stanford.EDU>
Message-Id: <9005152028.AA19912@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: [AR.TXA@Forsythe.Stanford.EDU: CHILLED WATER AND STEAM SHUTDOWN ON MEMORIAL DAY WEEKEND]
Folks, as you can read below, the chilled water will be shut off from
Sunday, May 27th, 0800 thru Monday, May 28th, 1200 (noon). Depending
on how cool the weather is that weekend, we will try and keep as many
systems up and running as possible during this outage. In the past,
we have done a pretty good job using large window fans that bring in
outside air. I will contact system administrators prior to the
shutdown if I feel that the machine/s that you are responsible for may
have to be turned off.
Tom Dienstbier CSDCF
To: tom@score.Stanford.EDU
From: "Terry Adams" <AR.TXA@Forsythe.Stanford.EDU>
Subject: CHILLED WATER AND STEAM SHUTDOWN ON MEMORIAL DAY WEEKEND
[1900] MON 05/07/90 10:20 FROM AR.TXA "Terry Adams": UTILITIES SHUTDOWN;
23 LINES (FILED)
TO: ALL USERS OF CHILLED WATER AND STEAM
EXCEPT MEDICAL CENTER AND FORSYTHE
(esp. temperature controlled research facilities)
RE: ANTICIPATED SHUTDOWN OF CHILLED WATER AND STEAM GENERATION
FROM 8:OOAM SUN. 5/27, TO NOON, MON. 5/28
FROM: DAVID KAYE, OPERATIONS MANAGER
TERRY ADAMS, O&M SHUTDOWN COORDINATOR
Please forward this message to anyone you know who might be
concerned.
This shutdown is required for inspection and repairs to the high
pressure steam system in the cogeneration plant. This is our "ounce
of prevention" which will make the plant more effective and reliable
in the hot months ahead.
∂16-May-90 1056 LOGMTC-mailer CS 350
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 10:55:58 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14449; Wed, 16 May 90 10:56:58 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA18267; Wed, 16 May 90 10:57:05 PDT
Date: Wed, 16 May 90 10:57:05 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9005161757.AA18267@coraki.stanford.edu>
To: logic@cs.Stanford.EDU
Subject: CS 350
Anyone have the catalog description of CS 350 online? I want to
email it to a prospective instructor.
-v
∂16-May-90 1431 shankle@sierra.Stanford.EDU 1990 DEPARTMENTAL AWARDS FOR OUTSTANDING SERVICE
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 14:31:31 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Wed, 16 May 90 14:29:13 PDT
Date: Wed, 16 May 90 14:29:13 PDT
From: shankle@sierra.Stanford.EDU (Diane J. Shankle)
To: EE-faculty@sierra.Stanford.EDU
Cc: EE-adminlist@sierra.Stanford.EDU
Subject: 1990 DEPARTMENTAL AWARDS FOR OUTSTANDING SERVICE
Message-Id: <CMM.0.88.642893352.shankle@>
REMINDER
OUTSTANDING SERVICE AWARDS
NOMINATIONS
DUE
MAY 22, 1990 5:00 P.M.
McC 164
OR
SHANKLE @SIERRA
∂16-May-90 1433 gilberts@Sunburn.Stanford.EDU ["Rosemary F. Napier" <napier@Sunburn.Stanford.EDU> : goodbye for
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 14:33:13 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22041; Wed, 16 May 90 14:31:05 -0700
Date: Wed, 16 May 1990 14:31:04 PDT
From: Edie Gilbertson <gilberts@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, phd@Sunburn.Stanford.EDU,
mscs@Sunburn.Stanford.EDU, sec@Sunburn.Stanford.EDU,
staff@Sunburn.Stanford.EDU
Subject: ["Rosemary F. Napier" <napier@Sunburn.Stanford.EDU> : goodbye for
Sharon & Aleta ]
Message-Id: <CMM.0.88.642893464.gilberts@Sunburn.Stanford.EDU>
Reminder....
The reception for Sharon Hemenway and Aleta Akhtar is
*this* afternoon.
Hope you can join the farewell gathering at 4:00 in the
lower courtyard behing MJH.
---------------
Return-Path: <napier>
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10361; Tue, 15 May 90 08:47:09 -0700
Full-Name: Rosemary F. Napier
Date: Tue, 15 May 1990 8:47:08 PDT
From: "Rosemary F. Napier" <napier@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, phd@Sunburn.Stanford.EDU,
mscs@Sunburn.Stanford.EDU, Margaret@Mojave.Stanford.EDU,
Perrie@SUMEX-AIM.Stanford.EDU, Pollock@sunburn.Stanford.EDU,
Rogers@SUMEX-AIM.Stanford.EDU, Timothy@sumex-aim.Stanford.EDU,
littell@Sunburn.Stanford.EDU, sloan@Sunburn.Stanford.EDU,
tom@Sunburn.Stanford.EDU, albert3@sunburn.Stanford.EDU,
ariadne@eclipse.Stanford.EDU, baldwin@Sunburn.Stanford.EDU,
bergman@cs.Stanford.EDU, bergman@sunburn.Stanford.EDU,
carol@coyote.Stanford.EDU, caroline@eclipse.Stanford.EDU,
chandler@Sunburn.Stanford.EDU, davis@sunburn.Stanford.EDU,
dean@patience.Stanford.EDU, dewerk@cs.Stanford.EDU,
eileen@sierra.Stanford.EDU, gilberts@sunburn.Stanford.EDU,
gotelli@Sunburn.Stanford.EDU, gotelli@cs.Stanford.EDU,
gsmith@SUMEX-AIM.Stanford.EDU, irvine@sumex-aim.Stanford.EDU,
jimenez@sunburn.Stanford.EDU, jones@sunburn.Stanford.EDU,
jutta@cs.Stanford.EDU, jutta@sunburn.Stanford.EDU,
mary@patience.Stanford.EDU, merryman@sunburn.Stanford.EDU,
mps@sail.Stanford.EDU, napier@sunburn.Stanford.EDU,
nevena@pescadero.Stanford.EDU, nilsson@TENAYA.Stanford.EDU,
pollock@cs.Stanford.EDU, prior@hudson.Stanford.EDU,
rlm@cs.Stanford.EDU, siroker@eclipse.Stanford.EDU,
stager@cs.Stanford.EDU, tajnai@cs.Stanford.EDU,
tajnai@hudson.Stanford.EDU, taleen@sunburn.Stanford.EDU,
tcr@SUMEX-AIM.Stanford.EDU, ursula@sunburn.Stanford.EDU,
wheaton@sunburn.Stanford.EDU, winkler@sunburn.Stanford.EDU
Subject: goodbye for Sharon & Aleta
Message-Id: <CMM.0.88.642786428.napier@Sunburn.Stanford.EDU>
TO: Graduate Students, Faculty, Staff
FROM: Rosemary Napier <napier@sunburn>
RE: Sharon Hemenway and Aleta Akhtar
are leaving the dept. soon.
This Wednesday, May 16 at 4pm, is set aside for you
to spend with them. Join us in the Psychology patio
for some wine and cheese and a little traveling music.
∂16-May-90 1447 LOGMTC-mailer Seminar in Logic and Foundations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 14:47:16 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23112; Wed, 16 May 90 14:48:18 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA19983; Wed, 16 May 90 14:49:41 PDT
Date: Wed, 16 May 1990 14:49:40 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.642894580.sf@csli.stanford.edu>
Speaker: Prof. Lou van den Dries, Univ. of Illinois, visiting MSRI
Title: "O-minimal structures and tame topology"
Time: Monday, May 21, 4:15-5:30 PM
Place: Room 381-Mathematics, Stanford
There will be a dinner out with the speaker, following the talk.
Abstract to follow.
∂16-May-90 1448 LOGMTC-mailer [vddries@msri.org (Lou Van den Dries) : Abstrac]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 14:47:55 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23132; Wed, 16 May 90 14:48:54 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA20004; Wed, 16 May 90 14:50:04 PDT
Date: Wed, 16 May 1990 14:49:59 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: [vddries@msri.org (Lou Van den Dries) : Abstrac]
Message-Id: <CMM.0.88.642894599.sf@csli.stanford.edu>
Return-Path: <vddries@msri.org>
Received: from msri.org (legendre.msri.org) by csli.Stanford.EDU (4.1/inc-1.0)
id AA22076; Tue, 15 May 90 21:55:45 PDT
Received: by msri.org (AIX 2.1.2/s2.2)
id AA10845; Tue, 15 May 90 21:48:05 PDT
Date: Tue, 15 May 90 21:48:05 PDT
>From: vddries@msri.org (Lou Van den Dries)
Message-Id: <9005160448.AA10845@msri.org>
To: sf@csli.stanford.edu
Subject: Abstract
Title talk: O-minimal structures and tame topology.
Abstract: I will indicate how the main facts on semi-algebraic and subanalytic
sets can be derived in the very general framework of "sets definable in an
O-minimal structure". This realizes to some extent a foundational program of
Grothendieck ("topologie moderee"). I will also discuss a recent application
to a problem in probability (Vapnik-Chervonenkis classes of subanalytic sets).
∂16-May-90 1506 LOGMTC-mailer Seminar in Logic (correction)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 15:05:59 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23805; Wed, 16 May 90 15:07:02 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA20915; Wed, 16 May 90 15:08:25 PDT
Date: Wed, 16 May 1990 15:08:24 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@CS.stanford.edu
Subject: Seminar in Logic (correction)
Message-Id: <CMM.0.88.642895704.sf@csli.stanford.edu>
The van den ies seminar will be in Room 381-T, Mathematics.
∂16-May-90 1538 ingrid@russell.Stanford.EDU CSLI Calendar, 17 May, vol. 5:28
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 16 May 90 15:38:11 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA04386; Wed, 16 May 90 14:53:35 PDT
Date: Wed, 16 May 90 14:53:35 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005162153.AA04386@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 17 May, vol. 5:28
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
17 May 1990 Stanford Vol. 5, No. 28
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 17 MAY 1990
12:00 noon TINLunch
Cordura 100 Logical Consequence and Model-Theoretic
Consequence, II: Lessons and Perspectives
Greg O'Hair
Visiting Scholar from The Flinders University
of South Australia
(ohair@csli.stanford.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 5
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Derivation vs. Constraints in Syntax
Speakers: Joan Bresnan, Ivan Sag, Peter Sells
(bresnan@csli.stanford.edu, sag@csli.stanford.edu,
sells@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 24 MAY 1990
12:00 noon TINLunch
Cordura 100 Grammaticalization of Discourse Context:
An HPSG Approach to Korean (and Japanese)
Suk-Jin Chang
Visiting Scholar from Seoul National University
(chang@csli.stanford.edu)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 6
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Derivation vs. Constraints in Syntax
Speakers: Joan Bresnan, Ivan Sag, Peter Sells
(bresnan@csli.stanford.edu, sag@csli.stanford.edu,
sells@csli.stanford.edu)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Grammaticalization of Discourse Context:
An HPSG Approach to Korean (and Japanese)
Suk-Jin Chang
Discourse situations involving interpersonal relations and speech acts
of the discourse participants regulate the use of morpholexical forms
of certain grammatical categories in Korean and Japanese, including
speech (honorific) levels, sentence types, personal
pronouns/nonpronouns, nouns, and verbs. Two discourse functions,
topic and focus, are also partially grammaticalized in these
languages: topic by topic markers (e.g., NUN in K and WA in J); focus
by stress, question words, or focus positions (in pseudo-cleft
constructions). Grammaticalization of such contextual and functional
information is presented and elaborated in the general framework of
HPSG (Pollard and Sag 1987, 1990) and by way of broadening and
deepening its CONTEXT sort with psoas (or infons) made available from
situation semantics.
____________
NEXT WEEK'S CSLI SEMINAR
Controversies in Natural-Language Research 6
Derivation vs. Constraints in Syntax
Joan Bresnan, Ivan Sag, Peter Sells
We will have a "panel discussion" of issues arising out of the
previous weeks' presentations.
____________
SYMBOLIC SYSTEMS FORUM
On the Self-Deconstruction of the Symbolic Order
Jean-Pierre Dupuy
French & Italian Department
Stanford University
Thursday, 17 May, 4:15 p.m.
Building 60, Room 61G
Are French and American philosophies doomed to ignore each other
forever? The notion of the "symbolic system" might provide a ground
on which to test the possibilities of cross-fertilization between
French thought and analytic philosophy. I will focus on an aspect of
symbolic forms (e.g., social conventions and institutions) that is
rarely discussed: the fact that they are moral, earmarked for
decomposition and, ultimately, for destruction.
Among the topics I may broach in this perspective are the following:
the meaning of a text, the nature of literary conventions and the
liar's paradox; social hierarchies in religious societies and rituals
of the carnival type; the paradox of self-amendment in the philosophy
of law; the logic of Derridian deconstructions; the notion of
"reputation" in the reflections on the foundations of game theory; the
paradox of backward induction; the concept of "convention" in the
works of D. K. Lewis and J. M. Keynes.
Next week: The Genesis of Symbolic Forms in Human Culture, Rene'
Girard, French & Italian Department, Stanford University.
____________
LANGUAGE ACQUISITION INTEREST GROUP
The Acquisition of Case in Japanese
and
The Acquisition of Transitivity in Japanese
(two talks)
Hiromi Morikawa
Department of Psychology
Stanford University
Friday, 18 May, 12:00 noon
Building 100, Greenberg Room
No abstract available.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
The Ethics of Foregoing Life-Sustaining Treatment
Howard Ducharme
University of Akron
Friday, 18 May, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Title to be announced
Bill Poser
(poser@csli.stanford.edu)
Friday, 18 May, 3:30 p.m.
Cordura 100
No abstract available.
____________
PHONOLOGY WORKSHOP
On Syllabic Nuclei in Nilotic and Germanic
Gerrit J. Dimmendaal
Leiden University
(currently visiting UC Berkeley)
Tuesday, 22 May, 7:30 p.m.
Ventura 17
In recent studies on nonlinear phonology, it has been claimed that
languages cannot have both falling and rising diphthongs, and that
nuclei with three x-positions (in syllable templates) are excluded.
Western Nilotic languages such as Dinka and Nuer have been claimed to
have both rising and falling diphthongs, while the same languages have
a phonemically distinctive three-way vowel length distinction. The
main purpose of my talk will be to investigate how well the
theoretical claims hold in the case of Western Nilotic, and to what
extent they help us in understanding how the syllable nucleus in
Western Nilotic is structured. I will compare the results with
observations made on syllable nuclei in dialects of German, as well as
Dutch and in Frisian. if time allows me, I will also look at rhythmic
rules determining vowel length in Southern Nilotic, and mora-counting
in Eastern Nilotic.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Negotiator Cognition
Max Bazerman
Northwestern University
Wednesday, 23 May, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
NEW PUBLICATIONS
The following reports have recently been published. They may be
obtained, or a full list of CSLI publications acquired, by writing to
Dikran Karagueuzian, CSLI, Ventura Hall, Stanford University,
Stanford, CA 94305-4115, or publications@csli.stanford.edu.
CSLI-90-138
Discourse Structure and Performance Efficiency in Interactive and
Noninteractive Spoken Modalities
Sharon L. Oviatt and Philip R. Cohen
$5.50
CSLI-90-139
The Contributing Influence of Speech and Interaction on Human
Discourse Patterns
Sharon L. Oviatt and Philip R. Cohen
$3.50
CSLI-90-140
The Connectionist Construction of Concepts
Adrian Cussins
$6.00
CSLI-90-141
Sixth Year Report
∂17-May-90 0728 tom@Sunburn.Stanford.EDU [GE.APL@Forsythe.Stanford.EDU: Apple Announces Price Decrease on Mac Plus, SE and SE/30]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 May 90 07:28:32 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA05321; Thu, 17 May 90 07:12:44 -0700
Date: Thu, 17 May 90 07:12:44 -0700
From: Tom Dienstbier <tom@Sunburn.Stanford.EDU>
Message-Id: <9005171412.AA05321@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: [GE.APL@Forsythe.Stanford.EDU: Apple Announces Price Decrease on Mac Plus, SE and SE/30]
If anyone is interested.
tom
Return-Path: <GE.APL@Forsythe.Stanford.EDU>
Date: Thu, 17 May 90 01:49:59 PDT
To: tom@score.Stanford.EDU
From: "Kevin Warner, Apple" <GE.APL@Forsythe.Stanford.EDU>
Subject: Apple Announces Price Decrease on Mac Plus, SE and SE/30
We all share a vision of changing the world by extending our
technologies to education. Now, the prospect of extending the
acceptance of Macintosh technology into education has never been
brighter.
I am pleased to announce significant education price reductions on
several Macintosh models. Effective May 15th,1990 Education prices
for the Macintosh Plus, Macintosh SE Floppy, Macintosh SE 1/20,
Macintosh SE 2/40, Macintosh SE/30, Macintosh SE/30 1/40, and
Macintosh SE/30 4/80 Systems have been lowered significantly. In
addition, Apple Computer is offering Higher Education a Macintosh
Plus and Imagewriter II Bundle at a special price which provides
additional savings.
With Macintosh as a mainstream product in Higher Education, this
pricing is important for a number of reasons, most important of
which is our commitment to Higher Education. These price points for
our entry products will help stretch your dollars and help Stanford
University Departments maximize the number of Macintoshes that can
be purchased with fiscal year end purchases.
We hope that you share our enthusiasm for this exciting news.
Enclosed are the most recent pricing changes.
Best Regards,
Kevin Warner
Apple Computer
********************************************************************
New Pricing effective May 15th
Stanford
Bookstore's
Microdisc Center
Part Number Description Price to Qualified
Stanford University
Purchasers**
M5880 MacPlus............................ $ 684.00
B0323LL/A Macintosh Plus &
Printer (ImageWriter II) Bundle.... $ 999.00
M0029LL/A SE fl.............................. $1,066.00*
M0028LL/A SE 1/20............................ $1,119.00*
M0031LL/A SE 2/40............................ $1,336.00*
1269
M5392 SE/30 fl........................... $1,724.00*
M5390 SE/30 1/40......................... $2,023.00*
M5961 SE/30 4/80......................... $2,745.00*
*Keyboard for Macintosh SE and SE 30 sold separately. Please add
your choice of Apple Keyboards listed below:
M0115 Apple Extended Keyboard............ $ 144.00
M0116 Apple Keyboard..................... $ 81.00
**Prices quoted include a discount for payments made in cash, check
or money order payable to Stanford Bookstore. A limit of one system
unit per customer. Prices are for Stanford University
departments,faculty, staff and degree-seeking or certificate-seeking
students, who are enrolled with a minimum of 6 credit-hours per
quarter, only.
To: COMBUYN
cc: LESLIEJ@SLACVM, RCC@MACBETH
∂17-May-90 0942 chandler@Sunburn.Stanford.EDU Marc Levoy
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 May 90 09:42:14 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13293; Thu, 17 May 90 09:43:15 -0700
Date: Thu, 17 May 1990 9:43:14 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: jmc-lists@sail.Stanford.EDU
Cc: mps@cs.Stanford.EDU, chandler@Sunburn.Stanford.EDU
Subject: Marc Levoy
Message-Id: <CMM.0.88.642962594.chandler@Sunburn.Stanford.EDU>
I will appreciate your vote for Marc Levoy. Please send it to me at your
earliest opportunity. Thanks much.
∂17-May-90 1118 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Seminar Reminder
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 17 May 90 11:18:14 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Thu, 17 May 90 09:48:05-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Thu, 17 May 90 09:46:37 PDT
Date: Thu, 17 May 90 09:49 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Seminar Reminder
To: Complex-Systems@Warbucks.AI.SRI.COM
Message-ID: <19900517164958.5.BERGMAN@HUXLEY.AI.SRI.COM>
Rules of Thumb: An Application of AI to Behavioral Ecology
Jonathan Roughgarden
Thursday, May 17 1990, 1:15PM
Room EJ 228
Address: SRI International
333 Ravenswood Ave.
Menlo Park, CA
VISITORS: Please arrive 5 minutes early so that you can be escorted up
from the E-building receptionist's desk. Thanks!
-----------------------------------------------------------------------------------
Send submissions, questions, address maintenance and requests to present talks to
"complex-systems-request@AI.SRI.COM" or Bergman@AI.SRI.COM
- Aviv.
∂17-May-90 1138 ingrid@russell.Stanford.EDU Two Special Talks, 22 and 24 May
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 May 90 11:37:54 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA13509; Thu, 17 May 90 11:18:01 PDT
Date: Thu, 17 May 90 11:18:01 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005171818.AA13509@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Two Special Talks, 22 and 24 May
TWO SPECIAL LECTURES:
THE VIEWS OF FREGE AND WITTGENSTEIN ON THE RELATION OF
LANGUAGE TO THE WORLD
Dr. Helena Smirnova
Institute of Philosophy
Moscow
Tuesday, 22 May, 4:00-6:00 p.m.
Cordura 104
and
NATURAL DEDUCTION SEARCH IN DIALOGUE INTERFACE
Dr. V. A. Smirnov
Institute of Philosophy
Moscow
Thursday, 24 May, 4:00-6:00 pm
Ventura 17
∂17-May-90 1419 chandler@Sunburn.Stanford.EDU General Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 17 May 90 14:19:34 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22621; Thu, 17 May 90 14:20:25 -0700
Date: Thu, 17 May 1990 14:20:25 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: General Faculty Meeting
Message-Id: <CMM.0.88.642979225.chandler@Sunburn.Stanford.EDU>
There will be a general faculty meeting on June 12, 1990 at 2:30 in MJH-146.
The main agenda item is to approve degree candidates. Please let me know of
any additional agenda items.
∂18-May-90 0820 mps@Gang-of-Four.Stanford.EDU Marc Levoy
Received: from Gang-of-Four.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 May 90 08:20:47 PDT
Received: by Gang-of-Four.Stanford.EDU (5.61/inc-1.0)
id AA22338; Fri, 18 May 90 08:21:12 -0700
Date: Fri, 18 May 90 08:21:12 -0700
From: mps@Gang-of-Four.Stanford.EDU (Pat Simmons)
Message-Id: <9005181521.AA22338@Gang-of-Four.Stanford.EDU>
To: chandler@Sunburn.Stanford.EDU
Cc: jmc-lists@sail.Stanford.EDU, chandler@Sunburn.Stanford.EDU
In-Reply-To: "R. Joyce Chandler"'s message of Thu, 17 May 1990 9:43:14 PDT <CMM.0.88.642962594.chandler@Sunburn.Stanford.EDU>
Subject: Marc Levoy
John will be back on the 29th of May.
∂18-May-90 1017 chandler@Sunburn.Stanford.EDU 5/22 Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 May 90 10:12:33 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13832; Fri, 18 May 90 10:12:11 -0700
Date: Fri, 18 May 1990 10:12:09 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, bureaucrats@Sunburn.Stanford.EDU,
staff-rep@Sunburn.Stanford.EDU, stefik@xerox.com,
psz@sumex-aim.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Cc: chandler@Sunburn.Stanford.EDU, cn.mcs@forsythe.Stanford.EDU
Subject: 5/22 Faculty Lunch
Message-Id: <CMM.0.88.643050729.chandler@Sunburn.Stanford.EDU>
Please check to be sure your calendars are marked for next Tuesday's faculty
lunch, 12:15 5/22 in MJH-146. Rebecca Lasher from the Math/Comp Sci Library
will be visiting with us to talk about making technical reports available
electronically. See you next Tuesday.
∂18-May-90 1022 spicer@sierra.Stanford.EDU Special Seminar
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 18 May 90 10:22:34 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Fri, 18 May 90 10:20:08 PDT
Date: Fri, 18 May 90 10:20:08 PDT
From: spicer@sierra.Stanford.EDU (William E. Spicer)
To: ee-faculty@sierra.Stanford.EDU, rw.aac@forsythe,
beasely@sierra.Stanford.EDU, geballe@sierra.Stanford.EDU
Cc: spicer@sierra.Stanford.EDU
Subject: Special Seminar
Message-Id: <CMM.0.88.643051207.spicer@>
SPECIAL SEMINAR
DR. BAIRD BRANDOW
LOS ALAMOS NATIONAL LABORATORY
TUESDAY, MAY 29TH
McCULLOUGH 240
2:00 P.M.
Analysis of Photoemission Data for CuO:
Revision of the Configuration-Energy Scheme for
Cuprate Materials
ABSTRACT
The generally accepted configuration-energy scheme
for ionic compounds of the late 3d transition metals is
in qualitative conflict with the systematics of older
photoemission data for transition-metal oxides. This
observation led us to carefully examine the Sawatzky
methodology for photoemission data analysis. We have
now shown that: (a) The Sawatzky procedure can
produce two different solutions (different model-
Hamiltonian parameter sets) and is, therefore,
ambiguous; (b) Use of oxygen 2p as well as copper 3d
spectral information resolves this ambiguity in favor of
the old (Powell-Spicer, Adler-Feinleib) picture for the
late 3d transition-metal oxides; (c) The evidence from
resonant photoemission, which has played a key role in
supporting the Sawatzky picture, is misleading because
of strong adiabatic corrections to the sudden
approximation; (d) a good fit to the available CuO data
requires several additional refinements beyond any
published treatment, particularly with regard to the
crystal-field-splitting aspect.
(Note: see bulletin boards for full abstract
since Greek symbols and formulas do not seem to
transmit on electronic mail.)
Host: W. E. Spier
∂19-May-90 1252 @Sunburn.Stanford.EDU:howardm@Neon.Stanford.EDU Re: parking
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 19 May 90 12:51:57 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07256; Sat, 19 May 90 12:35:10 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA17794; Sat, 19 May 90 12:35:07 -0700
Date: Sat, 19 May 90 12:35:07 -0700
From: Howard A. Miller <howardm@Neon.Stanford.EDU>
Message-Id: <9005191935.AA17794@Neon.Stanford.EDU>
To: csd-list@cs.stanford.edu, nilsson@tenaya.Stanford.EDU
Subject: Re: parking
∂20-May-90 2040 axwang@Theory.Stanford.EDU This week's AFLB
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 20 May 90 20:40:18 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA18302; Sun, 20 May 90 20:30:08 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA01861; Sun, 20 May 90 20:36:42 -0700
Message-Id: <9005210336.AA01861@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: This week's AFLB
Date: Sun, 20 May 90 20:36:41 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
The speaker at AFLB this week will be Peter Sarnak, from Stanford and
IBM Almaden. AFLB will meet on Thursday in MJH 252. Note that,
unlike the PACO seminar, which begins at 12:15pm, AFLB starts at
12:00pm.
Diophantine problems and graphs
Abstract:
We will discuss the problem of counting integer points on sets defined
by polynomial equations and related eigenvalue problems. This relationship
allows us to give simple and elementary constructions of expander graphs.
peter
∂21-May-90 1142 wheaton@Sunburn.Stanford.EDU ACM Doctoral Dissertation Awards
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 May 90 11:42:24 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA28585; Mon, 21 May 90 11:40:22 -0700
Date: Mon, 21 May 90 11:40:22 -0700
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9005211840.AA28585@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Subject: ACM Doctoral Dissertation Awards
Nils is out of town this week, and this message has definite "time value".
gw
**********************************************************************
Dear Faculty Members:
Nominations are invited from all faculty members for the 1989
ACM/MIT Press Doctoral Dissertation Award. This Award is given
annually to recognize and encourage superior research and writing by
doctoral candidates in Computer Science and Engineering.
To be considered for the award, the dissertation must first be
nominated by the author's advisor. The ACM will accept only 2 from
our department this year, so a department committee has been charged
to read all of the nominated dissertations, evaluate them, and forward
two of the theses to the ACM for further consideration.
THE NOMINATED DISSERTATIONS MUST REACH THE ACM BY JULY 1, SO YOU MUST
ACT NOW IF YOU WISH TO NOMINATE ONE OF YOUR STUDENT'S THESES. Our own
committee will require ample time to evaluate the nominations, so
please make your nominations NO LATER THAN FRIDAY, JUNE 8.
The ACM requires that the advisor submit a one page summary describing
the significance of the dissertation.
To be eligible, the dissertation must have been fully accepted by the
department between July 1, 1989 and the present July 1. Dissertations
submitted in June 1989 that were too late to be considered last year
are also eligible. In addition, the author must agree to surrender
all publication rights to the ACM. In case the MIT Press decides to
publish it, the author will receive a royalty.
∨
∂21-May-90 1414 @Sunburn.Stanford.EDU:tajnai@Hudson.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 May 90 14:14:37 PDT
Received: from Hudson.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA04435; Mon, 21 May 90 14:10:06 -0700
Received: by Hudson.Stanford.EDU (5.61+IDA/25-eef) id AA10280; Mon, 21 May 90 14:07:27 -0700
Date: Mon, 21 May 1990 14:07:26 PDT
From: "Carolyn E. Tajnai" <tajnai@Hudson.Stanford.EDU>
To: faculty@cs.Stanford.EDU, res-assoc@cs.Stanford.EDU, phd@cs.Stanford.EDU
Cc: na.phl@forsythe.Stanford.EDU
Message-Id: <CMM.0.88.643324046.tajnai@Hudson.Stanford.EDU>
Just a reminder of the Sunrise breakfast tomorrow morning.
---------------
Return-Path: <@Sunburn.Stanford.EDU:NA.PHL@Forsythe.Stanford.EDU>
Received: from Sunburn.Stanford.EDU by Hudson.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07979; Tue, 8 May 90 10:02:20 -0700
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03891; Tue, 8 May 90 10:04:31 -0700
Message-Id: <9005081704.AA03891@Sunburn.Stanford.EDU>
Date: Tue, 8 May 90 10:04:30 PDT
To: tajnai@cs.Stanford.EDU
From: "Portia Leet" <NA.PHL@Forsythe.Stanford.EDU>
TO: Sunrise Distribution
FROM: Portia Leet
RE: Sunrise Club, May 22nd
The final 1989-90 meeting of the Sunrise Club will be on Tuesday,
May 22nd at 7:30 a.m. in Tresidder Union Oak Lounge West. Dr.
Charles F. Goochee of the Chemical Engineering Department will speak
on "Emerging Issues in the Production of Human Pharmaceutical
Products Using Genetic Engineering Technology." Breakfast will be
served and the meeting will finish by 9:00 a.m.
Chuck Goochee studies factors affecting growth and product formation
for cultured mammalian and insect cells. His work addresses the
effects of environmental factors on protein post-translational
modifications, including glycosylation, sulfation, and
phosphorylation.
At this meeting, we will have some tables designated for specific
interests. As you sign in, you will be able to indicate at which
table you would like to sit.
If you plan to attend, please RSVP to me at na.phl@forsythe or by
phone 5-1585.
To: SUNRISE(CT.JFK,CT.MJF,CT.PAC,CT.VLS,DOWN@SIERRA,EE-FACULTY@SIERRA,
FACULTY@CS,FULLERTON@SIERRA,HAGSTROM@SIERRA,KRUGER@SIERRA,
LEVINTHAL@SIERRA,NA.ADP,NA.PHL,PHD@CS,REIS@SIERRA,RES-ASSOC@CS,
TAJNAI@CS), JC.PAB
∂21-May-90 1446 @Sunburn.Stanford.EDU:tah@linz.Stanford.EDU Forsythe Award
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 May 90 14:46:50 PDT
Received: from linz.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA05601; Mon, 21 May 90 14:47:00 -0700
Received: by linz.stanford.edu (5.59/25-eef) id AA01838; Mon, 21 May 90 14:47:48 PDT
Message-Id: <9005212147.AA01838@linz.stanford.edu>
To: faculty@cs.stanford.edu, csd@cs.stanford.edu
Subject: Forsythe Award
Date: 21 May 90 14:47:41 PDT (Mon)
From: Tom Henzinger <tah@linz.Stanford.EDU>
Let me remind you that the deadline for nominations for the
Sixteenth George E. Forsythe Award is June 1.
The Forsythe Award recognizes outstanding student contributions
to the teaching of Computer Science at Stanford. The award
criteria guidelines require that a recipient exhibit continued
involvement as well as excellent achievement in the field of
teaching.
The award is given annually by the Computer Science Department,
following the recommendations of a committee composed of the past
winners that are still at Stanford. Recent winners of the
Forsythe Award have been Oren Patashnik, Simran Singh, Devika
Subramanian, Steve Fisher, Mike Cleron, and Tom Henzinger.
Please mail your Forsythe Award nominations to tah@cs. Include
with your nomination a brief explanation of how your nominee
fulfills the requirements. Nominations are invited especially
from students.
Thank you,
The Forsythe Award Committee
∂21-May-90 1721 LOGMTC-mailer Ph.D. Oral (Tues. 5/22)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 21 May 90 17:20:51 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10437; Mon, 21 May 90 17:21:49 -0700
Received: from LOCALHOST by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22305; Mon, 21 May 90 17:21:43 -0700
Message-Id: <9005220021.AA22305@Neon.Stanford.EDU>
To: su-events@shelby.stanford.edu, logic@cs.stanford.edu
Subject: Ph.D. Oral (Tues. 5/22)
Date: Mon, 21 May 90 17:21:40 -0700
From: Roger Crew <crew@Neon.Stanford.EDU>
Ph.D. Oral
Roger Crew
Tuesday, May 22, 1990
1:15 pm
MJH 146
Metric Process Models
---------------------
Abstract:
We consider partial order models of concurrency (e.g., Winskel's
event structure model), equipping them with a general composition
rule, obtained as a limit. This composition admits arbitrary
pastings of processes, via both networks and the usual concurrency
connectives. Independently we extend the partial-order notion of
time to a much broader metric notion based on semirings. We organize
these extensions to be compatible with each other.
∂22-May-90 0733 tom@Sunburn.Stanford.EDU [GE.APL@Forsythe.Stanford.EDU: Apple Computer and Microdisc Announce Trade-up Program!]
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 07:33:49 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA15460; Tue, 22 May 90 07:20:02 -0700
Date: Tue, 22 May 90 07:20:02 -0700
From: Tom Dienstbier <tom@Sunburn.Stanford.EDU>
Message-Id: <9005221420.AA15460@Sunburn.Stanford.EDU>
To: csd-list@Sunburn.Stanford.EDU
Subject: [GE.APL@Forsythe.Stanford.EDU: Apple Computer and Microdisc Announce Trade-up Program!]
If anyone is interested..
tom
Return-Path: <GE.APL@Forsythe.Stanford.EDU>
Date: Tue, 22 May 90 00:26:09 PDT
To: tom@score.Stanford.EDU
From: "Kevin Warner, Apple" <GE.APL@Forsythe.Stanford.EDU>
Subject: Apple Computer and Microdisc Announce Trade-up Program!
Stanford Bookstore's Microdisc Center and Apple Computer, Inc., is
sponsoring a Trade-up program June 7th-8th and June 11th-15th for
Stanford University.
This program will offer Stanford University students,faculty, staff,
departments and schools a convenient method to upgrade their current
Macintosh systems, by trading-in their lower end Mac systems and
putting the trade-in value toward a higher end Macintosh from
Microdisc.
This is a great time to buy a new Macintosh computer! Apple has
just announced a price decrease, for Education customers only, on
select CPUs. A price decrease of $599.00 on the SE/30 puts the
Stanford Educational Discount price at just $2023.00 (SE/30 1/40).
For additional price decrease information on the Macintosh Plus and
Macintosh SE models, please see the announcement posted to the
SU-Macintosh Bulletin Board.
Listed Below is a sampling of trade-in values associated with
Microdisc's Trade-in program:
Apple IIe Floppy, 128k, Monitor, 2 drives..... $332.50
Mac 128k...................................... $95.00
Mac 512k...................................... $190.00
Mac 512ke..................................... $332.50
Mac Plus...................................... $617.50
Mac SE Floppy*................................ $950.00
Mac SE Floppy FDHD*........................... $997.50
Mac SE20*..................................... $1092.50
Mac SE20 FDHD*................................ $1140.00
Mac SE/30 40/1*............................... $1520.00
Mac II Floppy*................................ $1377.50
Mac II 40/1*.................................. $1710.00
*Trade-in value is for CPU only. Keyboards, stand alone monitors,
video cards, etc. may be redeemed separately.
Apple Standard Keyboard....................... $61.75
Apple Extended Keyboard....................... $95.00
Apple RGB Monitor............................. $285.00
Apple Monochrome Monitor...................... $142.50
Apple 8 bit video card........................ $247.00
Apple ImageWriter II.......................... $190.00
Apple LaserWriter............................. $902.50
Apple LaserWriter Plus........................ $1140.00
Apple LaserWriter II NT....................... $1330.00
Apple 800k Floppy Drive....................... $71.25
Apple 20MB HD Non SCSI........................ $190.00
Apple 20MB HD SCSI............................ $213.75
Note: Trade-in values shown above are for equipment that has been
evaluated as being in "good condition". Minor scratches and
discoloration on the case are acceptable but systems with burned-in
images on the screen and cases engraved or melted for property
identification purposes will receive a lower trade-in value. Please
visit Stanford Bookstore's Microdisc Center for any trade-in value
information not listed above.
********************************************************************
Trade-up stations will be located in front of Gate #2, Stanford
Stadium, June 7th-8th and June 11th-15th. Call (415)926-6238 to
make an appointment to have your Mac evaluated. You'll receive your
"Trade-Up Bucks" coupon to apply toward your new Macintosh purchase,
immediately following the evaluation procedure.
It is critical that you call the above number ASAP to help us
estimate the number of units that will be traded in and what systems
will need to be ordered from Apple to fulfill you trade-up order.
******************************************************************
Rules and Regulations of Program:
---------------------------------
Stanford University Departments/Schools are eligible for multiple
trade-ins. If a Department/School has over five trade-in machines
in one location, we will have a technical team come to your
department to evaluate your systems.
The system(s) that you purchase must be a more powerful Macintosh
system(s) than the system(s) that you are trading in, e.g. a Mac
Plus to an SE.
Procedures for Departments/Schools wishing to take part in this
program have been coordinated with the Stanford Procurement
Department and Property Administration. Please see your local
Department Property Administrators or Business Managers for full
details on the paperwork necessary to trade-in Stanford University
Property.
Students, Faculty and Staff are only eligible to purchase one system
that is a more powerful Macintosh system than the system that they
are trading in, e.g. a Mac Plus to an SE.
Individuals trading in a system must sign a contract at the time of
trade-in stating that the system which they are trading in is their
own system, and that the system they purchase is for their own
personal use. Anyone found in non-compliance will be subject to a
penalty fee equal to the suggested retail price minus the price of
the new system.
If you have any further questions regarding this program, please
call me at (415)926-6297, or Linda Michels at (415)926-6260.
Best regards,
Kevin Warner
To: COMBUYN
∂22-May-90 1000 shankle@sierra.Stanford.EDU Last Day
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 10:00:13 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 22 May 90 09:57:07 PDT
Date: Tue, 22 May 90 09:57:07 PDT
From: shankle@sierra.Stanford.EDU (Diane J. Shankle)
To: EE-faculty@sierra.Stanford.EDU
Cc: EE-adminlist@sierra.Stanford.EDU
Subject: Last Day
Message-Id: <CMM.0.88.643395426.shankle@>
Just a reminder that nominations are due today May 22, 1990 by 5:00 P.M.
for the Outstanding Service Awards.
Thanks,
Diane
McC 164
∂22-May-90 1320 grundy@csli.Stanford.EDU Symbolic Systems Forum, May 24
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 13:20:06 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA03339; Tue, 22 May 90 12:07:10 PDT
Date: Tue 22 May 90 12:07:09-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Symbolic Systems Forum, May 24
To: grundy@csli.Stanford.EDU
Message-Id: <643403229.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, May 24, 4:15 pm, room 60-61G
Speaker: Prof. Rene Girard
Topic: Desymbolization and Resymbolization in Human Culture
The structural anthropologists define cultural patterns
as systems of differences, or symbolic systems. In the light
of this definition, the violent crisis portrayed in tragedy
and other great literary texts must be interpreted as a
process of violent undifferentiation and desymbolization. A
striking example is Ulysses' famous speech in Troilus and
Cressida.
This view of desymbolization -- the destruction of
signification itself -- leads in turn to the interpretation
of paroxystic violence -- the collective murder of the hero
in Julius Caesar, for instance -- as the origin of (re)-
symbolization, the triggering device of cultural patterns,
the starting point of the Roman Empire.
If this conception of cultural cycles ending and
beginning in the same violence is taken seriously, it can
illuminate many archaic and even modern institutional
patterns.
-------
∂22-May-90 1528 LOGMTC-mailer tuesday seminar
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 15:28:25 PDT
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00604; Tue, 22 May 90 15:29:19 -0700
Message-Id: <14xyV2@SAIL.Stanford.EDU>
Date: 22 May 90 1528 PDT
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Subject: tuesday seminar
To: logic@CS.STANFORD.EDU
Speaker: Lou Galbiati
Title: A Simplifier for Untyped Lambda Expressions
Date: Tuesday 29 May 1990
Time: 4:15pm
Place: 301 Margaret Jacks
Abstract:
Many applicative programming languages are based on the call-by-value
lambda calculus. For these languages tools such as compilers, partial
evaluators, and other transformation systems often make use of rewriting
systems that incorporate some form of beta reduction. For purposes of
automatic rewriting it is important to develop extensions of beta-value
reduction and to develop methods for guaranteeing termination. This paper
describes an extension of beta-value reduction and a method based on
abstract interpretation for controlling rewriting to guarantee
termination. The main innovations are (1) the use of rearrangement rules
in combination with beta-value reduction to increase the power of the
rewriting system and (2) the definition of a non-standard interpretation
of expressions, the {\it generates} relation, as a basis for designing
terminating strategies for rewriting.
This is joint work of Lou Galbiati and Carolyn Talcott.
∂22-May-90 1530 LOGMTC-mailer Seminar in Logic and Foundations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 15:30:40 PDT
Received: from CS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00693; Tue, 22 May 90 15:31:41 -0700
Received: from gauss.Stanford.EDU by Aphid.Stanford.EDU with SMTP (5.61/25-eef) id AA03388; Tue, 22 May 90 15:31:39 -0700
Message-Id: <9005222231.AA03388@Aphid.Stanford.EDU>
Received: by gauss.stanford.edu (3.2/4.7); Tue, 22 May 90 15:30:56 PDT
Date: Tue, 22 May 90 15:30:56 PDT
From: sommer@gauss.Stanford.EDU (Richard Sommer)
To: logic@cs.Stanford.EDU
Subject: Seminar in Logic and Foundations
Talk to be presented by Rick Sommer on May 30:
On Fast Growing Functions and Fragments of Arithmetic
Abstract
First, subtheories of Peano Arithmetic (PA) obtained by
restricting the induction axioms to a subset C of the first order
formulas will be considered. For the cases C = Delta_0 and C =
Sigma_1, we will present a simple model-theoretic proof, due to Kirby
and Paris, of an upper bound, in terms of the Wainer hierarchy, to the
rates of growth of the recursive functions provably total in the
theory. Then the modifications necessary to generalize the proof to
the cases C = Sigma_n, for n > 1, will be discussed. Finally we will
consider how the proof can be further modified for fragments of PA
axiomatized by transfinite induction.
∂22-May-90 1544 LOGMTC-mailer Seminar in Logic and Foundations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 15:44:25 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01194; Tue, 22 May 90 15:45:24 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA12221; Tue, 22 May 90 15:46:45 PDT
Date: Tue, 22 May 1990 15:46:43 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: Seminar in Logic and Foundations
Message-Id: <CMM.0.88.643416403.sf@csli.stanford.edu>
Speaker: Prof. Rick Sommer, Dept. of Mathematics, Stanford University
Title: On fast growing functions and fragments of arithmetic
Time: Wed., May 30, 4:15-5:30 PM
Place: Room 383 N, 3d floor Math lounge, Stanford
Abstract by separate message.
∂22-May-90 1623 @Sunburn.Stanford.EDU:mps@Gang-of-Four.Stanford.EDU Joe Weening's Fare-thee-well Shindig
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 22 May 90 16:23:34 PDT
Received: from Gang-of-Four.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01499; Tue, 22 May 90 15:53:34 -0700
Received: by Gang-of-Four.Stanford.EDU (5.61/inc-1.0)
id AA14099; Tue, 22 May 90 15:52:57 -0700
Date: Tue, 22 May 90 15:52:57 -0700
From: mps@Gang-of-Four.Stanford.EDU (Pat Simmons)
Message-Id: <9005222252.AA14099@Gang-of-Four.Stanford.EDU>
To: csd-list@cs.Stanford.EDU
Subject: Joe Weening's Fare-thee-well Shindig
Joe will be moving to San Diego in June. The department will sorely
miss Joe's patient and helpful manner. Let us celebrate with him at a
dinner to be held on Wednesday, May 30.
If you would like to attend, please RSVP mps@go4, no later than
Friday, May 25th.
As soon as we get a headcount, we will let you know where the dinner
will be held and at what time.
If you know of someone not on the csd list, but who should be invited, please
have them call me at 723-6321. Thanks.
Pat
∂22-May-90 1652 davies@ai.sri.com PLANLUNCH -- Wednesday, May 30, 11 a.m. -- Yvan Leclerc
Received: from Warbucks.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 22 May 90 16:52:01 PDT
Received: from Dunes.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Tue, 22 May 90 16:47:03 PDT
Received: by Dunes.AI.SRI.COM (4.1/4.16)
id AA01181 for planlunch@ai.sri.com; Tue, 22 May 90 16:47:58 PDT
Date: Tue 22 May 90 16:47:57-PDT
From: DAVIES@Warbucks.AI.SRI.COM (Todd Davies)
Subject: PLANLUNCH -- Wednesday, May 30, 11 a.m. -- Yvan Leclerc
To: planlunch@Warbucks.AI.SRI.COM,
dolsen%scu.bitnet@cornellc.cit.cornell.edu
Message-Id: <643420077.0.DAVIES@DUNES.ARPA>
Mail-System-Version: <SUN-MM(229)+TOPSLIB(128)@DUNES.ARPA>
PLANLUNCH for Wednesday,
May 30, 1990, 11:00 a.m.
SRI International, EJ228
Simplicity of Description
as the Basis for Visual Interpretation
Yvan G. Leclerc
Artificial Intelligence Center
SRI International
ABSTRACT:
Vision is an inference process---one in which a description of the
outside world is inferred from images of the world, and prior
information about the world and image sensor. In the last century of
vision research, there have been two important approaches to
understanding what this inference process might be in humans. The first
is likelihood, wherein ``we perceive whatever object or scene would,
under normal conditions, most likely fit the sensory pattern [1].'' The
second is simplicity, wherein ``we perceive whatever object or scene
would most simply or economically fit the sensory pattern [1].''
With the advent of modern information theory, and in particular
Rissanen's Minimum-Description-Length (MDL) Principle, these two
approaches can now be seen as two sides of the same coin. That is, we
can now rigorously define what is meant by a ``simplest description,''
and this simplest description can be shown to be equivalent the ``most
likely description.''
In this talk, I will present some of the basic concepts of the MDL
Principle and some of the current research in applying this principle to
computer vision. This will include my own research in image
segmentation and perceptual grouping, and research in the recovery of
object parts from silhouettes and laser range-finder images.
------
[1] J.~Hochberg, ``Levels of Perceptual Organization,'' in ``Perceptual
Organization,'' M.~Kubovy and J.R.~Pomerantz (eds.), 1981.
NOTE FOR VISITORS TO SRI:
Please arrive at least 10 minutes early in order to sign in and
be shown to the conference room.
SRI is located at 333 Ravenswood Avenue in Menlo Park. Visitors may
park in the visitors lot in front of Building E (white concrete
building at 333 Ravenswood Ave., first driveway on the right, east of
Laurel) or in the conference parking area at the corner of Ravenswood
and Middlefield. The seminar room is in Building E. Visitors should
sign in at the reception desk in the Building E lobby.
IMPORTANT: Attendance is open, but visitors from certain countries
designated by the US government must make arrangements in advance. If
you have not already made such arrangements before your arrival,
admission to the seminar will be denied. If you believe you may be
from one of these countries and if you wish to make arrangements to
attend, please call Dori Arceo at (415) 859-2641.
-------
∂23-May-90 0730 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU OOP Symposium Call
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 07:30:52 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA21794; Wed, 23 May 90 07:31:14 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22779; Wed, 23 May 90 07:31:28 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14017; Wed, 23 May 90 07:27:28 -0700
Message-Id: <9005231427.AA14017@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7496; Wed, 23 May 90 09:25:05 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7464; Wed, 23 May 90 09:25:03 CDT
Date: Wed, 23 May 90 09:52:06 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
James Ten Eyck <JZBV@MARISTB.watson.ibm.com>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: James Ten Eyck <JZBV%MARISTB.watson.ibm.com@VM1.NoDak.EDU>
Subject: OOP Symposium Call
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PARTICIPATION
SYMPOSIUM ON OBJECT-ORIENTED PROGRAMMING
EMPHASIZING PRACTICAL APPLICATIONS
SEPTEMBER 14-15, 1990
MARIST COLLEGE, POUGHKEEPSIE, NY
Sponsored by the Division of Computer Science & Mathematics,
Marist College in cooperation with ACM special interest group on
programming languages (SIGPLAN).
The Symposium will include a tutorial on object-oriented programmingg
that will be presented by Richard Wiener, a keynote address by Bertrand
Meyer, and paper presentations and panel discussions that will explore
the advantages and difficulties of adopting the object-oriented
paradigm. Papers and panel suggestions are sought on all related topics,
specifically including:
QMaking the transition to the OOP paradigm
QManaging reusability
QStructuring industrial strength applications
QOOP within the undergraduate curriculum
QIntegration with traditional paradigms
Qperformance issues
The deadline for submitting full papers and 2-page panel proposals
is May 31, 1990. The length of the paper normally should not exceed 15
pages. Papers will be refereed, and those accepted will be published in
a Proceedings of the Symposium.
Submissions should consist of 4 copies of the full paper or panel
proposal. An abstract and a special title page containing the author's
name and affiliation should be included.
Documents should be single spaced, with the text area measuring 6≤" by 9".
Submissions should be sent to
SOOPPA
Division of Computer Science
Marist College
Poughkeepsie, N. Y.
Attention Fred Benfer
Email: hzap@maristb.bitnet
The deadline for advance registration is August 1, 1990. ion
Inquiries about registration inquiries should be sent to:
Michael Lewis
Director of Academic Computing
Bard College
Annandale-on-Hudson, NY 12504
(914) 758-7495
Email: jxaw@maristb.bitnet
Exhibits of appropriate hardware, software products, and textbooks
are being solicited. All vendor inquiries, and all other questions
concerning the symposium should be directed to
James Ten Eyck, General Chairperson
Marist College
82 North Road
Poughkeepsie, NY 12601
(914) 471-3240 x 601
Email: jzbv@maristb.bitnet
Important Dates
May 31 Papers Due
July 10 Notification
August 1 Early Registration Ends
August 10 Final Copy of accepted papers Due
September 14,15 Symposium
Steering Committee:
Fred Benfer, IBM Thornwood
Stuart Greenfield, Marist College
Peter Gumm, SUNY New Paltz
Nancy Ide, Vassar
Michael Lewis, Bard College
Roger Norton, Marist College
Onkar Sharma, Marist College
Eric Wagner, IBM Yorktown
∂23-May-90 0732 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Mathematical Systems Theory -- Announcement
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 07:32:18 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA21803; Wed, 23 May 90 07:32:48 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22790; Wed, 23 May 90 07:33:02 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA14024; Wed, 23 May 90 07:32:00 -0700
Message-Id: <9005231432.AA14024@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7610; Wed, 23 May 90 09:26:19 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7593; Wed, 23 May 90 09:25:48 CDT
Date: Wed, 23 May 90 09:52:13 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Arnie Rosenberg <rsnbrg@elys.cs.umass.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Arnie Rosenberg <rsnbrg%elys.cs.umass.edu@VM1.NoDak.EDU>
Subject: Mathematical Systems Theory -- Announcement
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
We are proud to announce the new incarnation of
MATHEMATICAL SYSTEMS THEORY
---An International Journal on Mathematical Computing Theory
with a scope narrowed to theoretical computer science (as opposed to
all aspects of systems theory) and an Editorial Board expanded to
cover the entire field better. Here are the basic facts about the
Journal.
PUBLISHER: Springer-Verlag
ESTABLISHED: 1966
FREQUENCY: Four times a year
LANGUAGE: English
PERSONNEL:
EDITOR-IN-CHIEF: Arnold L. Rosenberg
ADVISORY BOARD: Ronald V. Book
Fan R. K. Chung
Zvi Galil
EDITORIAL BOARD: Alok Aggarwal Thomas Lengauer
Joost Engelfriet Stephen R. Mahaney
Shimon Even Azaria Paz
Harold N. Gabow David Plaisted
Shafi Goldwasser Alan L. Selman
Sheila A. Greibach Uwe Schoening
S. Rao Kosaraju H. Raymond Strong
ADDRESSES:}
Dr. A. Aggarwal, IBM Watson Research Center, P.O Box 218,
Yorktown Heights, NY 10598
Prof. R. V. Book, Dept. of Mathematics, Univ. California,
Santa Barbara, CA 93106
Dr. F. R. K. Chung, Bell Communications Research, 435 South St.,
Morristown, NJ 07960
Prof. J. Engelfriet, Inst. Appl. Math. and Computer Science,
Univ. Leiden, P.O. Box 9512, 2300 RA Leiden, The Netherlands
Prof. S. Even, Computer Science Dept., Technion, Israel Inst. of Tech.,
Haifa 32000, ISRAEL
Prof. H. N. Gabow (Univ. Colorado at Boulder), 141 Dahlia St.,
Denver, CO 80220
Prof. Z. Galil, Dept. of Computer Science, Columbia Univ.,
New York, NY 10027
Prof. S. Goldwasser, Lab. for Computer Science, MIT, 545 Technology Sq.,
Cambridge, MA 02139
Prof. S. A. Greibach, Dept. of Computer Science, UCLA,
Los Angeles, CA 90024
Prof. S. R. Kosaraju, Dept. of Computer Science, Johns Hopkins Univ.,
Baltimore, MD 21218
Prof. T. Lengauer, Math.-Informatik, Univ. Paderborn, Warburger Str. 100,
4790 Paderborn, FRG
Prof. S. R. Mahaney, Computer Science Dept., Univ. Arizona,
Tucson, AZ 85721
Prof. A. Paz, Computer Science Dept., Technion, Israel Inst. of Tech.,
Haifa 32000, ISRAEL
Prof. D. Plaisted, Dept. of Computer Science, Univ. North Carolina,
Chapel Hill, NC 27599-3175
Prof. A. L. Rosenberg, Computer and Information Science,
Univ. Massachusetts, Amherst, MA 01003
Prof. A. L. Selman, College of Computer Science, Northeastern Univ.,
Boston, MA 02115
Prof. U. Schoening, Abt. Theor. Informatik, Universit\"{a}t Ulm,
Oberer Eselsberg, 7900 Ulm, FRG
Dr. H. R. Strong, IBM Almaden Research Center, 650 Harry Road,
San Jose, CA 95120-6099
EDITORIAL POLICY:
MATHEMATICAL SYSTEMS THEORY---An International Journal on Mathematical
Computing Theory is dedicated to broad coverage of original research
from all areas of theoretical computer science. Most issues of the
Journal will contain articles from a variety of areas of Theory, but
occasional issues will be devoted to special topics. (Special issues
may arise from a set of invited submissions, from responses to a
special Call for Submissions, or from the coincidental availability of
several accepted papers on similar themes.) Under special
circumstances, MST/MCT will publish survey articles. The Editorial
Board of MST/MCT is committed to trying to minimize publication delays
by vigilant monitoring of the entire review process.
SUBMISSION PROCEDURE:
Authors should send four copies of their submission to any member of
the Editorial Board (including the Advisory Board or the
Editor-in-Chief).
STATEMENT FROM THE EDITOR-IN-CHIEF:
MATHEMATICAL SYSTEMS THEORY was founded in 1966 as a journal devoted
to all types of mathematically formulated systems. By 1974, when
Sheila Greibach assumed leadership of the Journal, theoretical
computer science had become as dominant a focus as all other aspects
of systems theory combined. Recently, Springer-Verlag decided that
the two constituencies of the Journal had grown so far apart that a
split would be mutually beneficial; therefore, they inaugurated a new
journal, dedicated to the other areas of systems theory, and they
rededicated MATHEMATICAL SYSTEMS THEORY to focus solely on theoretical
computer science. The split and new focus have motivated two major
changes in MST: (1) We have replaced the departing systems theorists
on the Editorial Board with several highly respected theoretical
computer scientists, thereby both broadening and deepening our
coverage of the field. (2) We have augmented the title with the
phrase "An International Journal on Mathematical Computing Theory," to
reflect our narrowed scope. With our new focus, our expanded
Editorial Board, and our reduced backlog (due to the split), we feel
that we can offer the prospective author excellent service.
∂23-May-90 0842 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SODA -- announcement
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 08:42:00 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA21889; Wed, 23 May 90 08:42:27 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24546; Wed, 23 May 90 08:42:41 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16525; Wed, 23 May 90 08:42:14 -0700
Message-Id: <9005231542.AA16525@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7772; Wed, 23 May 90 09:27:09 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7738; Wed, 23 May 90 09:26:54 CDT
Date: Wed, 23 May 90 09:52:09 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Alok Aggarwal <aggarwa@ibm.com>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Alok Aggarwal <aggarwa%ibm.com@VM1.NoDak.EDU>
Subject: SODA -- announcement
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Second Annual ACM-SIAM Symposium on Discrete Algorithms
The second annual ACM-SIAM Symposium on Discrete Algo-
rithms, jointly sponsored by SIGACT and the SIAM Activity
Group for Discrete Mathematics, will be held January 28-30,
1991, in San Franscisco, California.
This conference is for those interested in the use,
design, and analysis of algorithms, with special emphasis on
questions of efficiency. Papers about algorithms (sequen-
tial, parallel, distributed, randomized, etc.) in all areas
of application are invited. A partial, but not exclusive
list of such areas includes combinatorial optimization, com-
putational geometry, computational graph theory, computa-
tional algebra and number theory, symbolic computation,
numerical and scientific computing, mathematical program-
ming, artificial intelligence, and data structures. Papers
dealing with new algorithmic applications are especially
welcome.
Although the symposium is not intended to focus on any
particular application area or algorithm type, it will
emphasize a particular mode of analysis. Papers are soli-
cited that, by mathematical or experimental analysis,
address the ways in which resource usage grows with increas-
ing problem size for realistic machine models, with
``resource'' interpreted broadly to include, for instance,
``nearness to optimality'' as well as such traditional meas-
ures as running time, storage, number of processors, and
amount of communication. Mathematical analysis may be
worst-case or probabilistic. (Lower bound results are
appropriate if they apply to real algorithmic problems).
Experimental papers can address a variety of issues, but
special consideration will be given to those that put
theoretical results into practical perspective or suggest
new avenues for theoretical investigation.
Papers will be selected for presentation based on
extended abstracts. Authors wishing to submit a paper
should send eleven copies of an extended abstract (not a
full paper) by July 30, 1990 to
Ray Sansone
SIAM
14th Floor
117 South 17th Street
Philadelphia, PA 19103-5052
Abstracts not received by the July 30 deadline (or post-
marked before July 23 and sent airmail) WILL NOT BE CON-
SIDERED. Authors will be notified of acceptance or rejec-
tion by September 28, 1990. A camera-ready copy of each
accepted paper will be due by November 9, 1990. Such copy
may be either on special forms (model pages), which will be
sent to the authors, or typeset onto 8.5 x 11 inch pages
according to a specified format. Authors who do not need
the model pages are requested to make note of that fact in
the letter of submittal.
SUBMISSION FORMAT. Abstracts should begin with a suc-
cinct statement of the problems that are considered in the
paper, the main results achieved, an explanation of the sig-
nificance of the work, and a comparison to past research.
This material should be readily understandable to nonspe-
cialists. Technical development, directed toward the spe-
cialist, should follow as appropriate. The entire extended
abstract must not exceed 10 double-spaced typed pages (about
12,000 bytes). Abstracts that deviate significantly from
these guidelines risk rejection without consideration of
their merits.
MEETING FORMAT. Authors of accepted papers will be
expected to present their work at the Symposium in a 20-
30 minute talk. In addition, there will be four one-hour
invited talks on topics of general interest.
PROGRAM COMMITTEE.
Alok Aggarwal, Chair (IBM Thomas J. Watson Research Center)
Allan Borodin (University of Toronto)
Harold N. Gabow (University of Colorado)
Zvi Galil (Columbia University and Tel Aviv University)
Richard M. Karp (University of California, Berkeley)
Daniel J. Kleitman (Massachusetts Institute of Technology)
Andrew M. Odlyzko (AT&T Bell Laboratories)
William R. Pulleyblank (University of Waterloo)
Eva Tardos (Cornell University)
Uzi Vishkin (University of Maryland and Tel Aviv University)
INVITED TALKS.
Ronald Graham (AT & T Bell Laboratories)
Eric Lander (Whitehead Institute)
Laszlo Lovasz (Eotvos Lorand University and Princeton University)
∂23-May-90 0842 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Splitting FOCS
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 08:42:28 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA21893; Wed, 23 May 90 08:42:49 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24558; Wed, 23 May 90 08:42:58 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16544; Wed, 23 May 90 08:42:39 -0700
Message-Id: <9005231542.AA16544@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7858; Wed, 23 May 90 09:29:05 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7842; Wed, 23 May 90 09:27:25 CDT
Date: Wed, 23 May 90 09:52:17 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Leonid Levin <lnd@CS.BU.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Leonid Levin <lnd%bu-cs.bu.edu@VM1.NoDak.EDU>
Subject: Splitting FOCS
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The FOCS business meeting is approaching fast. Before we resort to martial arts
over the parallel sessions issue let us consider some alternatives, radical but
peaceful. The old system led to the rejection of many good papers. The small
number of slots shares the blame with the superficial (even somewhat political)
nature of the review. The drawbacks of parallel sessions raise many objections.
To add the 4-th day, allowing ~90 papers, may be considered as a compromise.
A more radical solution would be to make 3, instead of 2, conferences:
early May, late August, early January. Given a flexibility to make them 3 or 4
days long, the annual number of papers can be set anywhere between 150 and 270.
But there are other interesting advantages. On all three time slots most people
have no classes. Attending will be not only easier timewise, but cheaper as
well: can be combined into a round-trip with a satellite conference or with
recreational activities. (I would love to dip in January into a tropical see or
to visit a ski resort. :-) Another curious merit: many people will attend only
2 (or 1) of the conferences. The choice will be based not only on seasons but
also on programs. This will create competition between program committees
forcing them to do more careful selection. The papers may be better prepared
since missing the deadline will be less dramatic: only 4 more months wait.
Another solution steams from the remarkable success of "email research"
which led to the famous IP results. The rapid exchange of ideas between a few
eliterian participants brought fast and crucial progress. We may keep the 60
paper limit on FOCS and STOC but supplement them with a year-round "network"
conference. It will be a moderated news-group run by a board similar to FOCS
committee, selecting 1 to 5 papers per week. Some papers will be accepted and
posted really fast while rejection will take normal refereeing.
Now, about name for either "extra FOCS" or net.focs ... It could be
either old "Informatica" or, may I propose another word, "Macro-Mathematics".
Traditional "micro"-Mathematics computes small objects. Existence proofs
combined with exhaustive search are often out of favor but not out of question.
For larger objects exhaustive search is insane and polynomial-time methods must
be found. Even such methods are only feasible for machines, not for humans.
Of course, Macro-Mathematics needs Macro funding. :-)
∂23-May-90 0851 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STACS 91: Call for Papers and Systems
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 08:43:25 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA21897; Wed, 23 May 90 08:43:44 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA24590; Wed, 23 May 90 08:43:59 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16562; Wed, 23 May 90 08:43:39 -0700
Message-Id: <9005231543.AA16562@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8019; Wed, 23 May 90 09:31:07 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
8001; Wed, 23 May 90 09:30:27 CDT
Date: Wed, 23 May 90 09:52:23 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Sven Koenig <koenig@ernie.berkeley.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Sven Koenig <koenig%ernie.berkeley.edu@VM1.NoDak.EDU>
Subject: STACS 91: Call for Papers and Systems
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
***************************************************************
CALL for PAPERS and SYSTEMS
STACS 91: Symposium on Theoretical Aspects of Computer Science
Hamburg, Germany: February 14 -- 16, 1991
**************************************************************
The Symposium on Theoretical Aspects of Computer Science is
organized jointly by the Special Interest Group for Theoretical
Computer Science of the GESELLSCHAFT f"ur INFORMATIK (GI), and the
Special Interest Group for Applied Mathematics of AFCET.
Typical, but not exclusive topics of interest are:
Abstract data types, algorithms and data structures, automata and
formal languages, computational complexity, computational
geometry, cryptography, computer systems theory, logic and
semantics of programming languages, mathematics of computation,
program specification, theory of parallel and distributed
computation, theory of robotics, VLSI structures, theory of data
bases.
Authors
are invited to submit 6 copies of a draft (in English, 5-12
pages) before August 15, 1991 to the chairman of the program
committee
Prof. Dr. Matthias Jantzen
Fachbereich Informatik (TGI)
Universitaet Hamburg
Rothenbaumchaussee 67/69
D-2000 Hamburg 13
W-Germany
e-mail: jantzen@rz.informatik.uni-hamburg.dbp.de
There will be the opportunity to demonstrate non-commercial
systems.
Compilers and interpreters, prototyping systems, term rewriting
systems, theorem provers, editors, systems for VLSI design
are welcome; this list is surely not exclusive. A two page
summary of each demonstrated system will be included in the
proceedings. Those who are interested in demonstrating systems
should contact the program committee chairman before September
15, 1991.
Program Committee:
A.Arnold (Bordeaux), W.Brauer (Muenchen), Ch.Choffrut (Rouen, chairman),
M.Cosnard (Lyon), A.Finkel (Paris), J.Gabarro (Barcelona),
J.Hastad (Stockholm), M.Jantzen (Hamburg, chairman), Ch.Rackoff (Toronto),
H.Reichel (Dresden), R.Reischuk (Darmstadt), W.Rytter (Warschau).
Invited Speakers:
J.-P.Jouannaud (Nancy), M.Wirsing (Passau),?
Organizing Committee: H.Durry (secretary), M.Jantzen,
M.Kudlek (organizing chairman), E.Thieme...
Dates:
Deadline for submission of papers: August 15, 1990
Deadline for submission of systems: August 15, 1990
Notification: October 20, 1990
Deadline for final text: November 20, 1990
Symposium: February 14 -- 16, 1991
Accepted papers and system abstracts will be published in the
proceedings of the symposium (Springer Lecture Notes in Computer
Science).
The symposium is organized in cooperation with EATCS, and is
sponsored by the University of Hamburg, Digital Equipment,
Sun Microsystems, Vereins- und Westbank Hamburg, and others.
******************************************************************
∂23-May-90 0921 taleen@Sunburn.Stanford.EDU phone message
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 09:21:10 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17652; Wed, 23 May 90 09:22:11 -0700
Date: Wed, 23 May 1990 9:22:11 PDT
From: "Taleen M. Nazarian" <taleen@Sunburn.Stanford.EDU>
To: mccarthy@cs.Stanford.EDU
Subject: phone message
Message-Id: <CMM.0.88.643479731.taleen@Sunburn.Stanford.EDU>
from Karen Bandy.
Office of Technology..... Washington, D.C. (202) 228-6767.
Taleen
∂23-May-90 0923 LOGMTC-mailer Ross Casley. Specifying concurrent systems.
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 09:23:45 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA17684; Wed, 23 May 90 09:24:48 -0700
Received: from LOCALHOST by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA26101; Wed, 23 May 90 09:24:47 -0700
Message-Id: <9005231624.AA26101@Neon.Stanford.EDU>
To: logic@cs.Stanford.EDU
From: Ross Casley <casley@Neon.Stanford.EDU>
Subject: Ross Casley. Specifying concurrent systems.
Reply-To: casley@cs.Stanford.EDU
Date: Wed, 23 May 90 09:24:45 -0700
Sender: casley@Neon.Stanford.EDU
PHD ORAL EXAMINATION
Specification of Concurrent Systems
-----------------------------------
Ross Casley
Time: Thursday, May 24, 2:15 pm.
Place: Margaret Jacks Hall, Room 352
Abstract:
Graphs labeled on edges and vertices are seen as control structures:
vertex labels specify actions, and edge labels specify constraints
between events. I treat edge labels via the notion of enriched
category and vertex labels via that of comma category, leading to a
simple language for specifying certain algebras of labeled graphs.
This language names classes whose elements can be viewed either as
edge labels, alphabets of vertex labels, or graphs. Given two such
classes D and E, D! is a class of graphs whose edge labels are drawn
from D, and D|>E is a class of graphs from D with vertices labeled by
an alphabet from E.
The classes namable by these two operations are a rich collection of
data types, with many applications besides control structures.
Representative examples are: 1! = sets, 1|>1! = pointed sets, 2! =
ordered sets, 1!|>1! = multisets, 2!|>1! = ordered multisets, 1!! =
categories, 2!! = order-enriched categories, 1!!! = 2-categories, 3!
= causal spaces, 3'!|>1! = prossets, and R! = premetric spaces.
As is traditional on such occasions, refreshments will be provided
after the talk.
∂23-May-90 1051 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Call For Paper Announcement..
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 10:50:50 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22388; Wed, 23 May 90 10:51:13 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01959; Wed, 23 May 90 10:51:27 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19477; Wed, 23 May 90 10:49:32 -0700
Message-Id: <9005231749.AA19477@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6845; Wed, 23 May 90 12:45:06 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
6827; Wed, 23 May 90 12:45:03 CDT
Date: Wed, 23 May 90 13:35:40 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Der-Tsai Lee <dlee@note.nsf.gov>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Der-Tsai Lee <dlee%note.nsf.gov@VM1.NoDak.EDU>
Subject: Call For Paper Announcement..
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
**********************************************************************
The International Journal of Foundations of Computer Science (IJFCS) is a
quarterly journal publishing articles which contribute new theoretical
results in all areas of foundations of computer science. The
theoretical and foundational areas covered include:
Algebraic theory of computing and formal systems
Analysis and design of algorithms
Automata and formal languages
Catagories in computer science
Combinatorics
Complexity theory
Computer theorem proving
Concurrency
Constructive logic
Database theory
Logic and semantics of programs
Logic in artificial intelligence
Logic programming
Models of Computation
Program verification and synthesis
Proof and specification in computer science
Theory of learning and inductive inference
Theory of parallel and distributed computing
Type theory
As computer science is an ever-evolving area, articles of other topics
are also invited. The journal also aims to provide a forum for the
communication and discussion of new fields needing more coverage and
exposure, and thus hopes to publish new attempts and proposals for
deepening the theoretical understanding of the nature of computation
and information.
Papers which combine originality and technical skill may be submitted
in the following categories:
1. Regular papers which describe original research work.
2. Correspondences (short papers) which are similar to regular papers
but are usually not as deep and less detailed.
3. Review/survey papers which are well-informed, incisive and
critical, providing a definite viewpoint, especially in areas where
developments have evolved rapidly. They should be of long-lasting
value to researchers.
Editorial Board:
L. Babai (U. Chicago)
D. Bjorner (Tech. Univ. of Denmark)
A. Blikle (Polish Academy of Sci.)
E. Borger (Univ. Pisa)
D. Bovet (Univ. of Rome)
J-Y. Cai (Princeton Univ.)
D. Chudnovsky (Columbia Univ.)
M. Davis (Courant Inst.)
M. Fitting (CUNY)
D. M. Gabbay (Imperial College)
J. Goguen (Oxford Univ.)
S. Goldwasser (MIT)
R.L. Graham (AT&T Bell Labs.)
S. Hayashi (Kyoto Univ.)
G. Huet (INRIA, Rocquencourt)
O. Ibarra (UC Santa Barbara)
K. Kobayashi (Tokyo Inst. of Technology)
P. Lauer (McMaster Univ.)
R.C.T. Lee (Nat'l Tsinghua Univ,Taiwan)
J.K. Lenstra (Eindhoven Univ. of Tech.)
H.B. Low (Inst. of Syst. Sci. Singapore)
X.W. Ma (Beijing Univ.)
A. Mate (CUNY)
A. Mazurkiewicz (Polish Academy of Sci.)
S. Peters (Stanford Univ.)
B. Richards (Imperial College)
A. Rosenberg (Univ. Massachusetts)
M. Sato (Tohoku Univ.)
D. Scott (Carnegie Mellon Univ.)
R. Siromoney (Madras Christian College)
A. Stolboushkin (Pereslavl-Zalessky, USSR)
P.S. Thiagarajan (SPIC Science Foundation, Madras)
D. Turner (Univ. of Kent)
J. Vuillemin (Paris Res. Lab.)
W. D. Wei (Sichuan Univ.)
A. Yonezawa (Univ. of Tokyo)
C.C. Zhou (Inst. of Software, Beijing)
Please submit your manuscripts in 5 copies to one of the following Managing
Editors:
Prof D. T. Lee Prof. R. Parikh
Division of Computer and Dept. of Computer Science
Computation Research CUNY Graduate Center
National Science Foundation 33 W. 42nd Street
1800 G St. NW New York, NY 10036
Washington DC 20550
Prof. E. Engeler Prof. J. Tucker
ETH-Zurich, Mathematik Dept. of Math. and Computer Sci.
ETH-Zentrum Univ. of College of Swansea
CH-8092 Zurich Singleton Park
Switzerland Swansea SA2 8PP
United Kingdom
Professor T Ito
Dept. of Information Engineering
Tohuku Univeristy
Aoba Aramaki
Sendai 980
Japan
Papers in the first issues (March, and June 1990):
On Evaluating Boolean Functions with Unreliable Tests(C. Kenyon & A.C. Yao)
On the Complexity of omega-Tree Sets and Nerode Theorem (A. Saoudi, D.E. Muller
& P.E. Schupp)
A Ring-Theoretic Basis for Logic Programming (V.S. Subrahmanian)
Applications of Lyndon Homomorphism Theorems to the Theory of Minimal Models
(M.A. Suchenek)
On a Personnel Assignment Problem (Wan-Di Wei)
Planar Point Location Revisited (F.P. Preparata)
Complete Evaluation of Horn Clauses: An Automata Theoretic Approach (B. Lang)
Recognizing Non-Floundering Logic Programs and Goals (R. Barbuti & M. Martelli)
etc.
Information for subsription can be obtained from the publisher in any
of the following offices:
Europe office: US office:
World Scientific Publishing Co.Pte.Ltd. World Scientific Publishing Co. Inc.
73 Lynton Mead 687 Hartwell Street
Totteridge, London N20 8DH Teaneck, NJ 07666-5309
England USA
Telefax: (01) 4463356 Toll-free: 1-800-227-7562
Tel: (01) 4462461 Telefax: (201) 837-8859
Tel: (201) 837-8858
Singapore office:
World Scientific Publishing Co. Pte.Ltd.
Farrer Road, P.O. Box 128
Singapore 9128
Cable Address: "COSPUB"
Telex: RS 28561 WSPC
Telefax: 2737298
Tel: 2786188
∂23-May-90 1052 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU References to Lw1w Logic (Lmega_1mega)
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 10:52:18 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22392; Wed, 23 May 90 10:52:43 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02021; Wed, 23 May 90 10:52:58 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19544; Wed, 23 May 90 10:51:34 -0700
Message-Id: <9005231751.AA19544@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 6931; Wed, 23 May 90 12:45:30 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
6915; Wed, 23 May 90 12:45:28 CDT
Date: Wed, 23 May 90 13:36:30 -0400
Reply-To: Hong Chen <hongch%sbcs.sunysb.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Hong Chen <hongch%sbcs.sunysb.edu@VM1.NoDak.EDU>
Subject: References to Lw1w Logic (Lmega_1mega)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am interested to know if there is any paper which applies the logic
Lw1,w to computer science. My main goal is to develop a framework to
deal with infinite lists of objects. Any pointer is appreciated.
Hong Chen
hongch@sbcs.sunysb.edu
∂23-May-90 1053 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Tree Rotation Distance
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 10:53:49 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22426; Wed, 23 May 90 10:54:21 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA02174; Wed, 23 May 90 10:54:36 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19599; Wed, 23 May 90 10:54:20 -0700
Message-Id: <9005231754.AA19599@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7031; Wed, 23 May 90 12:48:31 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7017; Wed, 23 May 90 12:45:55 CDT
Date: Wed, 23 May 90 13:36:34 -0400
Reply-To: Paul Callahan <callahan%crabcake.cs.jhu.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Paul Callahan <callahan%crabcake.cs.jhu.edu@VM1.NoDak.EDU>
Subject: Tree Rotation Distance
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
[I posted this to sci.math a while back, but no one responded.
I thought I'd try this (somewhat more appropriate) newsgroup.]
What is known about the problem of determining the minimum number
of rotations required to transform one (rooted, oriented) binary tree
into another? I attended a talk by Tarjan a couple years ago when
I was at Penn State, and I seem to remember him saying that the
existence of a polynomial time algorithm for this problem was an open
question.
I haven't noticed any references to this problem in the literature
(the closest I've found deal with the problem of bounding the maximum
distance for trees of a given size). I was curious whether or not this
question is still open. If no polynomial time algorithm is known,
can the problem be shown to be NP-complete? Is there some intuitive
reason that it is generally not thought to be NP-complete (as
with Graph Isomorphism, for example)?
I've thought about this problem long enough to realize I don't have
the background to handle it. However, it is very natural and appealing
from an aesthetic point of view (the relationship to polygon triangulations
is particularly elegant.) I would appreciate any references to related
results, old or new.
Thanks.
--
Paul Callahan
callahan@crabcake.cs.jhu.edu
∂23-May-90 1132 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU An algorithm for the "Game of Life"
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 11:32:04 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22524; Wed, 23 May 90 11:32:20 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05454; Wed, 23 May 90 11:32:35 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21099; Wed, 23 May 90 11:30:48 -0700
Message-Id: <9005231830.AA21099@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0077; Wed, 23 May 90 13:27:30 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0053; Wed, 23 May 90 13:24:52 CDT
Date: Wed, 23 May 90 14:20:48 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
"W. N. Pan" <H67BB@cunyvm.cuny.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: "W. N. Pan" <H67BB%cunyvm.cuny.edu@VM1.NoDak.EDU>
Subject: An algorithm for the "Game of Life"
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Is there anyboby who can tell me the best algorithm to solve
"Game of Life" or where I can find out? Your help is highly
appreciated. Since I didn't subscribe this list, please reply
me directly. Thanks again.
W.N. Pan
∂23-May-90 1132 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: ACM Election, The Sequel
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 11:30:12 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22510; Wed, 23 May 90 11:30:24 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05325; Wed, 23 May 90 11:30:38 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20946; Wed, 23 May 90 11:27:50 -0700
Message-Id: <9005231827.AA20946@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9833; Wed, 23 May 90 13:24:18 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
9796; Wed, 23 May 90 13:23:53 CDT
Date: Wed, 23 May 90 14:20:42 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
David Keaton <dmk@craycos.com>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: David Keaton <dmk%craycos.com@VM1.NoDak.EDU>
Subject: Re: ACM Election, The Sequel
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am one of those who left the ACM because it stopped serving the
academic community. I have no interest in the commercial side; I can
get that anywhere I want for free (in fact, someone is paying me to
deal with it). The only thing about the ACM that interests me is how
well it serves academia. That is why the loss of CACM drove me to
quit. I sent several letters about this to headquarters before
considering quitting, but I never got any response.
I held on longer than some. I stuck around long enough to vote
for Bryan Kocher. But last year I finally got so fed up with pouring
my membership dues down the drain that I had to leave. I am not
likely to want to rejoin until one of the following happens.
1) We are no longer forced to pay for a subscription to CACM
with part of our membership dues (i.e. the ACM becomes an
umbrella organization for the SIGs).
OR
2) CACM regains its stature as a source of new papers and
reference material that I am likely to refer to for years
in the future.
In other words, I want the ACM to either do it right, or step out of
the way an let the SIGs do it right. The benchmark I will use to
measure any progress is what happens to CACM (although we all know
that benchmarks are imperfect). Frankly, though, I don't think the
ACM can pull it off. I hope I am proved wrong.
David Keaton
(not necessarily representing here) Cray Computer Corporation
dmk@craycos.com
∂23-May-90 1138 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Nine Men's Morris
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 11:38:19 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22583; Wed, 23 May 90 11:38:41 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05898; Wed, 23 May 90 11:38:46 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21298; Wed, 23 May 90 11:36:43 -0700
Message-Id: <9005231836.AA21298@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0297; Wed, 23 May 90 13:30:26 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0247; Wed, 23 May 90 13:25:48 CDT
Date: Wed, 23 May 90 14:21:03 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>, johannes@i11s3.ira.uka.de
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: johannes%umbra.ira.uka.de@VM1.NoDak.EDU
Subject: Nine Men's Morris
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Does anybody know, if there is any literature pertaining to
the game called Nine Men's Morris (alias Muehle, merelles,
windmill etc.).
Does anybody know (can anybody proove) that white (who beginns)
has a sure win strategy at his hands?
Thanks for any indications.
Johannes
∂23-May-90 1219 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU request:formal lang. for OO-concepts
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 12:19:11 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22714; Wed, 23 May 90 12:19:40 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA09906; Wed, 23 May 90 12:19:55 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22503; Wed, 23 May 90 12:18:55 -0700
Message-Id: <9005231918.AA22503@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0440; Wed, 23 May 90 13:30:50 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0419; Wed, 23 May 90 13:26:52 CDT
Date: Wed, 23 May 90 14:20:55 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Angelika Buth <buth@zi.gmd.dbp.de>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Angelika Buth <buth%zi.gmd.dbp.de@VM1.NoDak.EDU>
Subject: request:formal lang. for OO-concepts
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
We are interested in formal languages which are suited to describe
object-oriented concepts like inheritance in a compact and programming
language independent way.
This will be part of our formal approach to the semantics of object-
oriented languages.
Thanks in advance for any input.
Angelika
Angelika Buth buth@gmdzi.uucp
German National Research Center
Schloss Birlinghoven
Postfach 1240
D-5205 Sankt Augustin
∂23-May-90 1222 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Maximum Weight Vertex-Disjoint Paths Problem
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 12:22:26 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22728; Wed, 23 May 90 12:22:49 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA10013; Wed, 23 May 90 12:23:04 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22534; Wed, 23 May 90 12:22:00 -0700
Message-Id: <9005231922.AA22534@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0622; Wed, 23 May 90 13:35:08 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0589; Wed, 23 May 90 13:30:28 CDT
Date: Wed, 23 May 90 14:21:06 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
John Kececioglu <johnk@arizona.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: John Kececioglu <johnk%arizona.edu@VM1.NoDak.EDU>
Subject: Maximum Weight Vertex-Disjoint Paths Problem
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Does anyone know of an approximation algorithm for the Maximum Weight
Vertex-Disjoint Paths Problem that achieves a worst-case performance ratio
better than 1/2?
(By this problem I mean, given an edge-weighted directed graph, to find a
subset of the edges of maximum total weight such that every vertex has at
most one incoming and at most one outgoing edge, and the subset is acyclic.
By worst-case performance ratio I mean the value of the approximate
solution divided by the value of the optimum solution, minimized over all
problem instances.)
--
John Kececioglu
johnk@cs.arizona.edu or arizona!johnk.uucp
Department of Computer Science, University of Arizona, Tucson, Arizona 85721
"Through small apertures we glimpse abysses whose somber depths turn us faint."
∂23-May-90 1257 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: request:formal lang. for OO-concepts
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 12:57:50 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22775; Wed, 23 May 90 12:58:07 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13088; Wed, 23 May 90 12:58:19 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23118; Wed, 23 May 90 12:56:49 -0700
Message-Id: <9005231956.AA23118@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0734; Wed, 23 May 90 13:35:39 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0720; Wed, 23 May 90 13:31:27 CDT
Date: Wed, 23 May 90 14:21:14 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Remi Zajac <zajac@is.informatik.uni.stuttgart.de>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Remi Zajac <zajac%is.informatik.uni.stuttgart.de@VM1.NoDak.EDU>
Subject: Re: request:formal lang. for OO-concepts
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
[Ait-Kaci 84] Hassan Ait-Kaci. 1984. A lattice-theoretic approach to
computation based on a calculus of partially-order type structures.
Ph.D Thesis, University of Pennsylvania, Philadelphia.
(A unifying approach of "conceptual graphs", "semantics networks",
"feature structures", and abstract data type theory formalized
using a fixed-point semantics)
[Ait-Kaci 86] Hassan Ait-Kaci. 1986. An algebraic semnatics approach
to the effective resolution of type equations. Theoretical Computer
Science 45, 293-351.
(A more accessible version of the main results of the PhD)
[Smolka & Ait-Kaci 97] Gert Smolka and Hassan Ait-Kaci. 1987. Inheritance
hierarchies: semantics and unification. J. Symbolic Computation 7, 343-370.
(Shows how the abovementioned work can be modeled in an order-sorted
equational logics using initial algebra semantics)
[Emele & Zajac 90] Martin Emele and Remi Zajac. 1990. A fixed-point
semantics for feature type systems. To be presented at the 2nd Intl.
Workshop on Conditional and Typed Rewriting Systems,
June 11-14, 1990, Montreal.
You migth also have a look in the field of computational linguistics
where interest in this kind of formalism is growing steadily :
[Pollard & Moshier] (in press). Unifying partial descriptions of sets.
In P.Hanson (ed.) Information, language and cognition. Vancouver Studies
in Cognitive Science I.
[Rounds 88] William C. Rounds. 1988. Set values for unification-based
grammar formalisms and logic programming. Manuscript, CSLI and Xerox PARC.
----------------
Remi Zajac
IMS-CL
University of Stuttgart
Forststr.86
D-7000 Stuttgart 1
West-Germany
zajac@is.informatik.uni.stuttgart.de
------------------
∂23-May-90 1259 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Voronoi Diagrams: call for data
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 12:59:45 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22799; Wed, 23 May 90 13:00:15 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13220; Wed, 23 May 90 13:00:26 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA23168; Wed, 23 May 90 12:58:39 -0700
Message-Id: <9005231958.AA23168@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0855; Wed, 23 May 90 13:39:31 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0837; Wed, 23 May 90 13:32:11 CDT
Date: Wed, 23 May 90 14:21:17 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Phil Bogle <phil@eleazar.dartmouth.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Phil Bogle <phil%eleazar.dartmouth.edu@VM1.NoDak.EDU>
Subject: Voronoi Diagrams: call for data
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
We are doing some practical time tests on different algorithms for
computing the Voronoi diagram, which (as Guibas and Stolfi put it) is a
"fundamental data structure of computational geometry...which can be
used as a powerful tool to give efficient algorithms for a wide variety
of other geometric problems." (e.g. given the Voronoi diagram we can
compute the closest pair, closest-neighbor, minimum spanning tree, etc.
in linear time.)
We would like to test the algorithms on data
connected with real-world problems instead of trying to define what
"typical" data should look like. If any of you compute this sort of
information from real-world data and wouldn't mind sending it to me via
net-mail, this would be much appreciated and could lead to faster
solutions to your problems in the future. Preferred format for the
data is simply white-space delimited lists of alternating x and y
values, but any reasonable format plus a description is fine. Thanks
in advance.
------------------------------------------
Phillip Bogle
Dartmouth College
phil@eleazar.dartmouth.edu
∂23-May-90 1335 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: ACM Election, The Sequel
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 13:35:13 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22852; Wed, 23 May 90 13:35:44 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15546; Wed, 23 May 90 13:35:57 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24749; Wed, 23 May 90 13:34:45 -0700
Message-Id: <9005232034.AA24749@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1963; Wed, 23 May 90 14:00:48 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1943; Wed, 23 May 90 14:00:44 CDT
Date: Wed, 23 May 90 14:21:11 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Don Gillies <gillies@p.cs.uiuc.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Don Gillies <gillies%p.cs.uiuc.edu@VM1.NoDak.EDU>
Subject: Re: ACM Election, The Sequel
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CACM may never regain the status it had in the 1970's, and maybe there
isn't anything CACM can do to regain its status.
Here is what little I know about the world the mid-1970's (CACM's heyday).
(a) The field of Computer Science, which was "shallow stuff", was
deepening.
(b) Academia was producing the biggest glut of C.S. Phd's in its history.
(c) There were less than (approx.) five places to publish a general
interest paper. In particular, the following places did not exist
IEEE "leecho" magazines (Computer, Software, AIExpert, Micro, Graphics)
Info. Processing Letters
ACM Transactions (Computers, Office Auto, Databases, Math, Languages).
Software Practice & Experience
Journal of Algorithms
Algorithmica
There are at least 50 places to publish a paper today.
(d) A C.S. department was founded at a place called Cornell University
a few years before. The founders decided that they would probably
have to adopt a special tenuring policy, since "there are so few
journals that would accept a paper on computer science."
Now you ask why CACM does not publish the kind of material it
published in the 1970's. I think the answer is above.
Many people are mad at ACM but I think this anger is misdirected. I
have seen definite attempts to improve CACM in the last few years,
such as: special theme issues with rapid publication turnaround, to
attract researchers and recent results, and the Pracnique section,
which is as deep as most of the stuff published in the 70's.
People who are mad at ACM should stop and reexamine whether their
gripes are with the organization, or with the field of computer
science as a whole, which is maturing, and will not be a "young field"
ever again.
Don W. Gillies, Dept. of Computer Science, University of Illinois
1304 W. Springfield, Urbana, Ill 61801
ARPA: gillies@cs.uiuc.edu UUCP: {uunet,harvard}!uiucdcs!gillies
∂23-May-90 1340 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: request:formal lang. for OO-concepts
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 13:40:12 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22876; Wed, 23 May 90 13:40:41 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15800; Wed, 23 May 90 13:40:56 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24845; Wed, 23 May 90 13:36:06 -0700
Message-Id: <9005232036.AA24845@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2159; Wed, 23 May 90 14:03:31 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2125; Wed, 23 May 90 14:02:21 CDT
Date: Wed, 23 May 90 14:21:21 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
"Steven D. Litvintchouk" <sdl@mbunix.mitre.org>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: "Steven D. Litvintchouk" <sdl%mbunix.mitre.org@VM1.NoDak.EDU>
Subject: Re: request:formal lang. for OO-concepts
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <2452@gmdzi.UUCP> buth@gmdzi.UUCP (Angelika Buth) writes:
> We are interested in formal languages which are suited to describe
> object-oriented concepts like inheritance in a compact and programming
> language independent way.
> This will be part of our formal approach to the semantics of object-
> oriented languages.
FOOPS is a high-level language that combines functional programming
with object-oriented programming (including multiple inheritance).
While FOOPS is executable, it can also be used as a specification
language for software to be implemented in conventional programming
languages (even non-object-oriented ones). FOOPS modules are
specified with equational logic.
FOOPS can address both inheritance of the specifications of abstract
data types and inheritance of their implementations. It is now widely
understood that inheritance of the implementation of a class--code
reuse--is quite different from inheritance of the abstract behavioral
specification of the class. The resulting class hierarchies may be
quite different.
For more info, see: "Unifying Functional, Object-Oriented and
Relational Programming with Logical Semantics," by Joseph Goguen and
Jose Meseguer, in the book "Research Directions in Object-Oriented
Programming," ed. by Bruce Shriver and Peter Wegner, The MIT Press,
1987.
Steven Litvintchouk
MITRE Corporation
Burlington Road
Bedford, MA 01730
(617)271-7753
ARPA: sdl@mbunix.mitre.org
UUCP: ...{att,decvax,genrad,ll-xn,philabs,utzoo}!linus!sdl
"Where does he get those wonderful toys?"
-- J. Napier (a.k.a. "The Joker")
∂23-May-90 1342 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU References to Lw1w Logic (Lmega_1mega)
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 13:41:54 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22900; Wed, 23 May 90 13:42:19 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15860; Wed, 23 May 90 13:42:35 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25087; Wed, 23 May 90 13:42:02 -0700
Message-Id: <9005232042.AA25087@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2267; Wed, 23 May 90 14:07:04 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2248; Wed, 23 May 90 14:03:17 CDT
Date: Wed, 23 May 90 14:21:32 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Hong Chen <hongch@sbcs.sunysb.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Hong Chen <hongch%sbcs.sunysb.edu@VM1.NoDak.EDU>
Subject: References to Lw1w Logic (Lmega_1mega)
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am interested to know if there is any paper which applies the logic
Lw1,w to computer science. My main goal is to develop a framework to
deal with infinite lists of objects. Any pointer is appreciated.
Hong Chen
hongch@sbcs.sunysb.edu
∂23-May-90 1342 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Research Paper
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 13:42:25 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22904; Wed, 23 May 90 13:42:44 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA15918; Wed, 23 May 90 13:42:54 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25118; Wed, 23 May 90 13:42:43 -0700
Message-Id: <9005232042.AA25118@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2385; Wed, 23 May 90 14:10:41 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2370; Wed, 23 May 90 14:05:17 CDT
Date: Wed, 23 May 90 14:21:24 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Catherine Hamon <hamon@loria.crin.fr>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Catherine Hamon <hamon%loria.crin.fr@VM1.NoDak.EDU>
Subject: Research Paper
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
I am working in editorial databases and I'm searching for a paper about
PAT published in the following proceedings. If anybody can help me to indicate
where I can find them, I'll appreciate it.
"Proceedings of the First Symposium on Discrete Algorithms " (SODA)
San Francisco, January 1990.
Please e-mail me your answers.
Many thanks
C. Hamon
∂23-May-90 1345 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary:formal lang. for OO-concepts
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 13:45:10 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22943; Wed, 23 May 90 13:45:39 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16143; Wed, 23 May 90 13:45:54 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25142; Wed, 23 May 90 13:43:13 -0700
Message-Id: <9005232043.AA25142@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2479; Wed, 23 May 90 14:16:54 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2469; Wed, 23 May 90 14:06:28 CDT
Date: Wed, 23 May 90 14:21:27 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Angelika Buth <buth@zi.gmd.dpb.de>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Angelika Buth <buth%zi.gmd.dpb.de@VM1.NoDak.EDU>
Subject: Summary:formal lang. for OO-concepts
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Summary of responses to my request on formal languages for OO-concepts
in comp.object and comp.theory.
<2452@gmdzi.UUCP> buth@gmdzi.UUCP (Angelika Buth)
Some responses were written in german, thus I tried to translate them correctly.
*****************************************************************************
Angelika, ich verstehe zwar nicht ganz, weshalb Du wert auf Sprachunab-
haengigkeit legst, aber eine oo-Sprache mit gut entwickelter Semantik ist
wohl OBLOG, welche von Ehrich und den beiden Sernadas entwickelt wird.
Im letzten (oder vorletzten) Heft der EIK dieses Jahres ist ein Ehrich-
Artikel erschienen, der wahrscheinlich weitere Literaturpointer enthaelt.
Mit freundlichen Gruessen,
Henning Fernau
Lehrstuhl Informatik fuer Ingenieure und Naturwissenschaftler
Universitaet Karlsruhe
Am Fasanengarten 5
D-7500 Karlsruhe 1
Fernruf: (0721)608-4336
email:fernau@ira.uka.de
(translation:
Angelika, I don't quite understand why you regard language independence as
important. An oo-language with well understood semantics is OBLOG which is
beeing developed by Ehrich and the two Sernadas. In the last (or last but one)
issue of EIK of this year is an article by Ehrich which is likely to contain
further references.)
Hans-Dieter Ehrich, Amilcar Sernadas and Cristiana Sernadas.
From Data Types to Object Types.
J. Inf. Process. Cybern. EIK 26 (1990) 1/2, pp. 33-46
*****************************************************************************
From: duncan@sungod.crd.ge.com (Art Duncan)
The Interface Description Language (IDL), developed by Nestor et al. at CMU
provides a very compact way to describe inheritance (both single and multiple)
in a language-independent way.
It does not, however, allow one to specify executable code (methodsf).
MELD, by Gail Kaiser and David Garlan, is an actual programming language based
on a number of the ideas of IDL.
I think much of the syntax and many of the concepts from IDL and MELD could
be used in a formal system for dealing with object-oriented concepts.
The standard reference to IDL is
Nestor, et al., IDL: The Language and its Implementation,
Prentice-Hall, 1989
MELD is described in
Kaiser, Gail and David Garlan,
MELDing Data Flow and Object-Oriented Programming,
proc. OOPSLA '87, Orlando Florida, October 1987.
published as SIGPLAN Notices 22(12), December 1987.
Hope this helps.
-- Art Duncan
*****************************************************************************
From: Ryan Stansifer <ryan@arthur.cs.purdue.edu>
I saw your request for formal languages to describe object-oriented
concepts on comp.theory. I as researcher in the field I suggest
that you look at:
Cardelli, Luca and John C. Mitchell.
Operations on records.
SRC Report 48, Digital Equipment Corporation, Systems Research
Center, Palo Alto, California, August 25, 1989.
Of course, what you need always depends on what you are trying to do.
viele Gruesse
Ryan Stansifer
Department of Computer Sciences
Purdue University
*****************************************************************************
From: esler@bucsf.bu.edu (Kevin Esler)
I suggest you look at a PhD thesis written by Bill Cook, last year at
Brown University. He may have laid the definitive groundwork for what
you wish to do. I believe Bill is currently working at HP Labs
somewhere.
****************************************************************************
Hi Angelika,
Some time ago I asked the news for information on a formal account
of CLOS semantics. I got only one reference which I forward to you:
W. Olthoff and J. Kempf - An Algebraic Specification of Method Combination for
the Common Lisp Object System - Lisp and Symbolic Computation, 2(1989),
115-152.
An other paper, which I've found really interesting, is:
Reimer U. and Hahn U. - A Formal Approach to the semantics of a Frame Data
Model - in Proc. AAAI 1983.
Those authors have written some other papers which I may indicate to you,
if you want.
I found really difficult to give an account of an OO-software in a
language-independent way. I tried to do this when I developed an
OO-constraint Language, but finally I ought to use a language-dependent
description. I'm interested to this topic till now, and I would like
to know what are you doing. Furthermore, please forward to me every
input you get from the news.
Thanks
Francesco Ricci
ricci@irst.uucp
*****************************************************************************
[Ait-Kaci 84] Hassan Ait-Kaci. 1984. A lattice-theoretic approach to
computation based on a calculus of partially-order type structures.
Ph.D Thesis, University of Pennsylvania, Philadelphia.
(A unifying approach of "conceptual graphs", "semantics networks",
"feature structures", and abstract data type theory formalized
using a fixed-point semantics)
[Ait-Kaci 86] Hassan Ait-Kaci. 1986. An algebraic semnatics approach
to the effective resolution of type equations. Theoretical Computer
Science 45, 293-351.
(A more accessible version of the main results of the PhD)
[Smolka & Ait-Kaci 97] Gert Smolka and Hassan Ait-Kaci. 1987. Inheritance
hierarchies: semantics and unification. J. Symbolic Computation 7, 343-370.
(Shows how the abovementioned work can be modeled in an order-sorted
equational logics using initial algebra semantics)
[Emele & Zajac 90] Martin Emele and Remi Zajac. 1990. A fixed-point
semantics for feature type systems. To be presented at the 2nd Intl.
Workshop on Conditional and Typed Rewriting Systems,
June 11-14, 1990, Montreal.
You migth also have a look in the field of computational linguistics
where interest in this kind of formalism is growing steadily :
[Pollard & Moshier] (in press). Unifying partial descriptions of sets.
In P.Hanson (ed.) Information, language and cognition. Vancouver Studies
in Cognitive Science I.
[Rounds 88] William C. Rounds. 1988. Set values for unification-based
grammar formalisms and logic programming. Manuscript, CSLI and Xerox PARC.
----------------
Remi Zajac
IMS-CL
University of Stuttgart
Forststr.86
D-7000 Stuttgart 1
West-Germany
zajac@is.informatik.uni.stuttgart.de
------------------
*****************************************************************************
Angelika,
das folgende ist ein schnell erstellter Ausschnitt aus meinem Bibtex-File
zum Thema Semantik von OO-Programmiersprachen. Die Themen denotationale Semantik
fuer OOPLs und Typesysteme dafuer sind z.Zt. anscheinend sehr aktuell, auf den
meisten Programmoiersprachenkonferenzen findet sich da was.
Rolf Bahlke bahlke@darmstadt.gmd.dbp.de
GMD - IPSI UUCP: ...!ipsi!bahlke
Dolivostr. 15 Tel. ++49-6151-875934
D-6100 Darmstadt West Germany
(translation:
It follows a quickly composed part of my BibTeX-file on semantics of oo
programming languages. Denotational semantics of OOPSs and
their type systems seem to be hot topic. You can find something in most
of the conferences on programming languages.)
@inproceedings (canning89,
author="Peter Canning and William Cook and Walter Hill and Walter Olthoff and
John C. Mitchell",
title="F-Bounded Polymorphism for Object-Oriented Programming",
crossref="fpca89",
pages="273--280")
@phdthesis (cook89a,
author="William R. Cook",
title="A Denotational Semantics of Inheritance",
school="Brown University",
year=1989,
month=may,
note="Technical Report CS-89-33")
@inproceedings (cook90,
author="William R. Cook and Walter L. Hill and Peter S. Canning",
title="Inheritance is not Subtyping",
crossref="popl90",
pages="1--1")
@article (danforth88,
author="Scott Danforth and Chris Tomlinson",
title="Type Theories and Object-Oriented Programming",
journal=acmcs,
volume=20,
number=1,
year=1988,
month=mar,
pages="29--72")
@techreport (hense90,
author="Andreas V. Hense",
title="The Denotational Semantics of an Object-Oriented Programming Language",
institution={Universit\"at des Saarlandes},
address={Saarbr\"ucken},
year=1990,
month=feb,
number="A 01/90")
@inproceedings (reddy88,
author="Uday S. Reddy",
title="Objects as Closures: Abstract Semantics of Object Oriented languages",
crossref="lfp88",
pages="289--297")
@article (yelland89,
author="P.M. Yelland",
title="First Steps Towards Fully Abstract Semantics for Object-Oriented
Languages",
journal="The Computer Journal",
volume=32,
number=4,
year=1989,
month=aug,
pages="290--296")
@proceedings(fpca89,
key="FPCA",
title="FPCA'89 Conference Proceedings Fourth International Conference on
Functional Programming Languages and Computer Architecture",
booktitle="FPCA'89 Conference Proceedings Fourth International Conference on
Functional Programming Languages and Computer Architecture",
year=1989,
month=sep,
address="London",
publisher="ACM Press")
@proceedings (popl90,
key="POPL",
title="Conference Record of the Seventeenth Annual ACM Symposium on Principles
of Programming Languages",
booktitle="Conference Record of the Seventeenth Annual ACM Symposium on
Principles of Programming Languages",
year=1990,
address="San Fransisco, California",
month=jan)
@proceedings(lfp88,
key="LFP",
title="Proceedings of the 1988 ACM Conference on LISP and Functional
Programming",
booktitle="Proceedings of the 1988 ACM Conference on LISP and Functional
Programming",
year=1988,
address="Snowbird",
month=jul)
*****************************************************************************
FOOPS is a high-level language that combines functional programming
with object-oriented programming (including multiple inheritance).
While FOOPS is executable, it can also be used as a specification
language for software to be implemented in conventional programming
languages (even non-object-oriented ones). FOOPS modules are
specified with equational logic.
FOOPS can address both inheritance of the specifications of abstract
data types and inheritance of their implementations. It is now widely
understood that inheritance of the implementation of a class--code
reuse--is quite different from inheritance of the abstract behavioral
specification of the class. The resulting class hierarchies may be
quite different.
For more info, see: "Unifying Functional, Object-Oriented and
Relational Programming with Logical Semantics," by Joseph Goguen and
Jose Meseguer, in the book "Research Directions in Object-Oriented
Programming," ed. by Bruce Shriver and Peter Wegner, The MIT Press,
1987.
Steven Litvintchouk
MITRE Corporation
Burlington Road
Bedford, MA 01730
(617)271-7753
ARPA: sdl@mbunix.mitre.org
UUCP: ...{att,decvax,genrad,ll-xn,philabs,utzoo}!linus!sdl
*****************************************************************************
***end of summary***
Thanks to all, who responded to my request.
Hopefully, I will get some good ideas while reading!
Angelika buth@gmdzi.uucp
∂23-May-90 1345 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Tree Rotation Distance
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 13:45:27 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22945; Wed, 23 May 90 13:45:48 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16152; Wed, 23 May 90 13:46:04 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25256; Wed, 23 May 90 13:45:52 -0700
Message-Id: <9005232045.AA25256@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2573; Wed, 23 May 90 14:19:24 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2565; Wed, 23 May 90 14:07:39 CDT
Date: Wed, 23 May 90 14:21:35 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
Paul Callahan <callahan@crabcake.cs.jhu.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: Paul Callahan <callahan%crabcake.cs.jhu.edu@VM1.NoDak.EDU>
Subject: Tree Rotation Distance
Comments: To: theorynt@vm1.nodak.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
[I posted this to sci.math a while back, but no one responded.
I thought I'd try this (somewhat more appropriate) newsgroup.]
What is known about the problem of determining the minimum number
of rotations required to transform one (rooted, oriented) binary tree
into another? I attended a talk by Tarjan a couple years ago when
I was at Penn State, and I seem to remember him saying that the
existence of a polynomial time algorithm for this problem was an open
question.
I haven't noticed any references to this problem in the literature
(the closest I've found deal with the problem of bounding the maximum
distance for trees of a given size). I was curious whether or not this
question is still open. If no polynomial time algorithm is known,
can the problem be shown to be NP-complete? Is there some intuitive
reason that it is generally not thought to be NP-complete (as
with Graph Isomorphism, for example)?
I've thought about this problem long enough to realize I don't have
the background to handle it. However, it is very natural and appealing
from an aesthetic point of view (the relationship to polygon triangulations
is particularly elegant.) I would appreciate any references to related
results, old or new.
Thanks.
--
Paul Callahan
callahan@crabcake.cs.jhu.edu
∂23-May-90 1428 chandler@Sunburn.Stanford.EDU Program Announcement
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 14:28:18 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA27048; Wed, 23 May 90 14:28:05 -0700
Date: Wed, 23 May 1990 14:28:03 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Program Announcement
Message-Id: <CMM.0.88.643498083.chandler@Sunburn.Stanford.EDU>
I have just received a Program Announcement from NSF entitled YOUNG SCHOLARS
PROGRAM FY 1991. I will be happy to send you a copy.
∂23-May-90 1435 @Sunburn.Stanford.EDU:rokicki@Neon.Stanford.EDU Joe Weening's Fare-thee-well Shindig
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 14:35:49 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26273; Wed, 23 May 90 14:06:15 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA17574; Wed, 23 May 90 14:06:10 -0700
Date: Wed, 23 May 90 14:06:10 -0700
From: Tomas G. Rokicki <rokicki@Neon.Stanford.EDU>
Message-Id: <9005232106.AA17574@Neon.Stanford.EDU>
To: mps@Gang-of-Four.Stanford.EDU
Cc: csd-list@cs.Stanford.EDU
In-Reply-To: Pat Simmons's message of Tue, 22 May 90 15:52:57 -0700 <9005222252.AA14099@Gang-of-Four.Stanford.EDU>
Subject: Joe Weening's Fare-thee-well Shindig
Count me in! -tom
∂23-May-90 1448 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU STOC/FOCS Bibliography: galleys
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 14:48:47 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA23064; Wed, 23 May 90 14:49:18 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA21287; Wed, 23 May 90 14:49:33 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27669; Wed, 23 May 90 14:49:06 -0700
Message-Id: <9005232149.AA27669@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4013; Wed, 23 May 90 16:46:25 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
3966; Wed, 23 May 90 16:46:09 CDT
Date: Wed, 23 May 90 16:12:11 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
"David S. Johnson" <dsj@research.att.com>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu, nu021172@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: "David S. Johnson" <dsj%research.att.com@VM1.NoDak.EDU>
Subject: STOC/FOCS Bibliography: galleys
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
STOC/FOCS BIBLIOGRAPHY galleys are in the mail!
The STOC/FOCS BIBLIOGRAPHY, which will list all the papers to
appear in STOC or FOCS proceedings from the first FOCS in 1960, should
be appearing this Fall. It will be mailed to all members of SIGACT free
of charge, and will be offered for sale to others by ACM.
The bibliography, where possible, will include "updates" for each
proceedings paper (citation of journal version, if any, corrigenda, solved
open problems, etc.) Thanks to widespread cooperation by the theory
community, we now have an update of some sort for over 80% of all
papers that appeared through 1988. Given the large number of updates
that had to be transcribed, and the fact that many of them are the results
of merging separate updates from different co-authors, we think it
worthwhile to give everyone a chance to check their entries before the
final version is prepared. We would also like to get information on a few
more of the as-yet-unupdated papers.
We are thus currently sending "galleys" to all locatable STOC/FOCS authors,
giving the entries in the bibliography for their papers as those entries
are currently scheduled to appear. Unfortunately, we do not have addresses
for all authors, and some of the addresses we do have may be out of date.
Thus this is a plea for authors who do not receive galleys to send
me a currently valid address, so that we can get the galleys to you in
a timely fashion.
As of 5/21, galleys have been mailed to all authors with 2 or more
STOC/FOCS papers (not counting STOC 1990) for whom we have addresses.
Galleys for authors with just 1 paper should have gone out by 5/28.
Corrections to the galleys can be either made physically on the galleys
themselves, or sent to me by email. The galleys do not cover the
1990 STOC conference, so if you have an update for a paper in that
conference, please include it (or send it to me separately). Also, any
other comments and suggestions about the bibliography are welcome.
David S. Johnson
Room 2D-150
AT&T Bell Laboratories
Murray Hill, NJ 07974
dsj@research.att.com
FAX: 201-582-2379
∂23-May-90 1547 ingrid@russell.Stanford.EDU CSLI Calendar, 24 May, vol. 5:29
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 23 May 90 15:47:39 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA10966; Wed, 23 May 90 15:11:19 PDT
Date: Wed, 23 May 90 15:11:19 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005232211.AA10966@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 24 May, vol. 5:29
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
24 May 1990 Stanford Vol. 5, No. 29
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 24 MAY 1990
12:00 noon TINLunch
Cordura 100 Grammaticalization of Discourse Context:
An HPSG Approach to Korean (and Japanese)
Suk-Jin Chang
Visiting Scholar from Seoul National University
(chang@csli.stanford.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 6
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Derivation vs. Constraints in Syntax
Speakers: Joan Bresnan, Ivan Sag, Peter Sells
(bresnan@csli.stanford.edu, sag@csli.stanford.edu,
sells@csli.stanford.edu)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 31 MAY 1990
12:00 noon TINLunch
Cordura 100 Spatial Mental Models
Barbara Tversky
Department of Psychology
Stanford University
(bt@psych.stanford.edu)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 7
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Propositional Attitudes and Russellian
Propositions
Speaker: Robert C. Moore
Artificial Intelligence Center, SRI International
(bmoore@ai.sri.com)
Abstract below
____________
NEXT WEEK'S TINLUNCH
Spatial Mental Models
Barbara Tversky
I will describe two sets of studies investigating spatial properties
of mental models induced entirely by text. In the first set, both
route and survey descriptions of medium- and large-scale environments
apparently yield the same perspective-free spatial models. In the
second set, narratives describe a common three-dimensional small-scale
spatial environment, and properties of the induced mental model are
examined in detail. These mental models are not perception-like or
image-like; rather, they seem to reflect people's conceptions of
space.
____________
NEXT WEEK'S CSLI SEMINAR
Controversies in Natural-Language Research 7
Propositional Attitudes and Russellian Propositions
Robert C. Moore
An adequate theory of propositions needs to conform to two sets of
intuitions that pull in quite different directions. One set of
intuitions concerning entailments (or, more specifically, the lack
thereof) among reports of propositional attitudes such as belief,
knowledge, or desire points toward a very fine-grained notion of
proposition. To be the objects of attitudes, propositions must
seemingly be individuated almost as narrowly as sentences of a natural
language. On the other hand, other intuitions seem to require that
propositions not be specifically linguistic entities -- rather that
they be proper "semantic" objects, whatever that really amounts to.
Over the last few years, a number of approaches have been proposed in
the attempt to reconcile these two types of intuitions. I believe
that the simplest approach with any hope of success is the recent
revival of the "Russellian" view of propositions, based on the
semantic ideas expressed in _The Principles of Mathematics_ (Russell,
1903, chapter V). Russell's idea at that time seems to have been that
a proposition consists of a relation and the objects related. This
contrasts with the "Fregean" view that a proposition must contain
something like concepts of the objects related by the relation, rather
than containing the objects themselves.
In this paper, we explore the Russellian view of propositions and its
adequacy as a basis for the semantics of propositional attitude
reports. We review some of the familiar problems of attitude reports
and suggest that a number of other approaches to their solution fall
short of the mark. We then sketch how these problems can be handled
by the Russellian approach, pointing out that it in fact offers a more
complete treatment of the problems than is sometimes realized, and we
present a formal treatment of a logic based on the Russellian
conception of a proposition. Finally, we discuss a number of
remaining issues, including the need to distinguish propositional
functions from properties and the problem of proper names in attitude
reports.
____________
SPECIAL LECTURE
Natural Deduction Search in Dialogue Interface
V. A. Smirnov
Institute of Philosophy
Moscow
Thursday, 24 May, 4:00-6:00 p.m.
Ventura 17
No abstract available.
____________
SYMBOLIC SYSTEMS FORUM
Desymbolization and Resymbolization in Human Culture
Rene' Girard
French & Italian Department
Stanford University
Thursday, 24 May, 4:15 p.m.
Building 60, Room 61G
The structural anthropologists define cultural patterns as systems of
differences, or symbolic systems. In light of this definition, the
violent crises portrayed in tragedy and other great literary texts
must be interpreted as a process of violent undifferentiation and
desymbolization. A striking example is Ulysses' famous speech in
_Troilus and Cressida_.
This view of desymbolization -- the destruction of signification
itself -- leads in turn to the interpretation of paroxystic violence
-- the collective murder of the hero in _Julius Caesar_, for instance
-- as the origin of (re-)symbolization, the triggering device of
cultural patterns, the starting point of the Roman Empire.
If this conception of cultural cycles ending and beginning in the same
violence is taken seriously, it can illuminate many archaic and even
modern institutional patterns.
____________
SPECIAL TALK
Feature Type Systems and MT
Remi Zajac
University of Stuttgart
Friday, 25 May, 11:00 a.m.-12:30 p.m.
Cordura 100
To describe correspondences between sets of strings and set of feature
descriptions, we can utilize CF grammars that use unification to
associate feature descriptions to nonterminals. In an MT system, we
need to describe more general correspondences between arbitrary sets
of feature descriptions. Until recently, this kind of formalism has
not been available. We give an introduction to this class of
formalism based on the notion of term rewriting, and we present a
simple example for transfer in an MT system. Because this kind of
formalism uses a more general scheme of computation than CF rewriting
augmented with unification, it is equipped with general programming
capabilities. We show how these capabilities can be exploited to
build a modular system where all constraints are integrated during
processing.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Creating the Kingdom of Ends: Responsibility
and Reciprocity in Personal Relations
Christine M. Korsgaard
University of Chicago
(visiting at UCLA)
Friday, 25 May, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Deep Unaccusativity and Multilevel versus Multistratal Theories
(based on work done with Joan Bresnan)
Annie Zaenen
Xerox PARC
(zaenen.pa@xerox.com)
Friday, 25 May, 3:30 p.m.
Cordura 100
Practitioners of multistratal frameworks often claim that theories
like LFG cannot handle certain phenomena because they do not have
recourse to underlying grammatical functions. I will discuss one
example of a generalization used to make such claims, i.e., the
account of the resultative construction in English, and show how LFG
accounts for this generalization. I then will discuss whether the
distinction between multistratal and multilevel theories is an
interesting one.
____________
POETICS WORKSHOP
Unstressed Syllables in the Rhythmic Patterns of
Contemporary Russian Verse
Vycheslav Ivanov
Moscow University
Tuesday, 29 May, 4:00 p.m.
Ventura 17
This talk was originally scheduled for 15 May, but had to be postponed
to this new date.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
On the Usefulness of Final Ends
Harry Frankfurt
Princeton University
Tuesday, 29 May, 4:15 p.m.
Building 380, Room 380W
No abstract available.
____________
SYNTAX WORKSHOP
X'-Structures and Sentence-Final Particles in Cantonese
Carol Neidle
Boston University
(visiting Xerox PARC and CSLI)
(neidle.pa@xerox.com)
Tuesday, 29 May, 7:30 p.m.
Cordura 100
Cantonese has between thirty-five and forty sentence-final particles
that can occur singly or in clusters. Previous studies have focused
primarily on their discourse functions. Syntactic analysis suggests
that these particles occur in syntactic function positions. It turns
out that many facts about the distribution, interpretation, and
combinatorial possibilities of the particles can be explained once the
X'-structures of Cantonese assumed in the literature are reexamined.
The following structure for CP in Chinese will be proposed and argued
for:
[ IP COMP SPEC ] .
CP
Material in these functional positions is particularly prone to
contraction. Phonological study (beyond the scope of this talk)
reveals that regular interactions among the segmental particles
postulated to appear in these positions and floating tones posited to
occur at the utterance boundary, which modify the meaning and the tone
of the utterance-final syllable, provide an economical and explanatory
account of the surface forms of particles and particle clusters. One
consequence of this analysis is the reduction of the particle
inventory.
This talk will concentrate on the syntactic properties and
distribution of several specific particles, and on the X'-structures
for Cantonese that are needed to account for them, although the
overall particle system will be described briefly. The analysis also
correctly predicts many additional particle clusters not previously
discussed in the literature.
The above is part of joint work with Sam-po Law of Boston University,
on the syntax and phonology of Cantonese sentence-final particles.
This will be the final syntax workshop of this school year.
____________
PSYCHOLOGY DEPARTMENT COLLOQUIUM
Basic Research in Action: Volunteerism and
Society's Response to AIDS
Mark Snyder
University of Minnesota
Wednesday, 30 May, 3:45 p.m.
Building 420, Room 050
No abstract available.
____________
∂25-May-90 0845 chandler@Sunburn.Stanford.EDU May 29 Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 May 90 08:45:46 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13819; Fri, 25 May 90 08:45:48 -0700
Date: Fri, 25 May 1990 8:45:48 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU, bureaucrats@cs.Stanford.EDU,
staff-rep@cs.Stanford.EDU, stefik@xerox.com,
psz@sumex-aim.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Cc: chandler@Sunburn.Stanford.EDU
Subject: May 29 Faculty Lunch
Message-Id: <CMM.0.88.643650348.chandler@Sunburn.Stanford.EDU>
Just to remind you of next Tuesday's faculty lunch....12:15 in Margaret Jacks
Hall conference room 146. Ralph Gorin will sit at the head table and tell us
what's happening these days over at AIR.
∂25-May-90 1152 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Splitting FOCS
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 May 90 11:52:40 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA25898; Fri, 25 May 90 11:52:32 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA12819; Fri, 25 May 90 11:52:58 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19480; Fri, 25 May 90 11:52:21 -0700
Message-Id: <9005251852.AA19480@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0341; Fri, 25 May 90 13:49:37 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0318; Fri, 25 May 90 13:49:33 CDT
Date: Fri, 25 May 90 14:46:07 -0400
Reply-To: gillies%p.cs.uiuc.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu, nu021172@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: gillies%p.cs.uiuc.edu@VM1.NoDak.EDU
Subject: Re: Splitting FOCS
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
> I have a problem with *that*! The AMS (to which I also belong)
> makes much more of an effort to hold down the costs of attending
> their conferences. (They often hold them at college campuses,
> and also include some weekend days, presumably so that those
> attending can get cheap airfares.)
It is surprising the way computer scientists can throw their
conference money around. Recently, the 4th Annual Conference on
Computational Geometry was held on this campus. All the lectures were
given in the campus performing arts center.
The cost of registration was over $200, and many mathematicians from
the U of Illinois chose not to attend because of the high registration
cost. It seems most math conferences cost $100 to register, at the
very most. The funding glut in C.S. may not last forever.
Adding a 3rd conference to FOCS and STOC, now that there is already
SODA held in San Francisco, seems like a great waste of money and/or
travel time. I don't believe in splitting a communication forum until
until you have tried all other available means to handle the traffic
(i.e. parallel sessions).
∂25-May-90 1155 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Summary(continued):formal lang. for OO-concepts
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 May 90 11:55:47 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA25924; Fri, 25 May 90 11:56:08 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA13104; Fri, 25 May 90 11:56:34 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19487; Fri, 25 May 90 11:53:58 -0700
Message-Id: <9005251853.AA19487@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0453; Fri, 25 May 90 13:51:23 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0431; Fri, 25 May 90 13:50:09 CDT
Date: Fri, 25 May 90 14:46:13 -0400
Reply-To: Angelika Buth <buth%zi.gmd.dbp.de@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu, nu021172@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Angelika Buth <buth%zi.gmd.dbp.de@VM1.NoDak.EDU>
Subject: Summary(continued):formal lang. for OO-concepts
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Continuation of summary of responses to my request on formal languages for
OO-concepts in comp.object and comp.theory.
<2452@gmdzi.UUCP> buth@gmdzi.UUCP (Angelika Buth)
******************************************************************************
With respect to your request in comp.object for a formal language for
OO concepts, I suggest you also have a look at Milner's CCS and Hoare's
CSP (see references below). In Geneva we are particularly interested
in formalisms that can describe the semantics of persistent (i.e.,
non-terminating) active objects. We are presently using Milner's
approach of defining an algebraic notation that captures the behaviour
of a collection of agents as a transition system over the set of
behaviour expressions. We then express the semantics of OO language
constructs and object models be translation to this notation (or by
extension of the notation by new operators appropriate to the language
model). If you are interested, I can send you copies of some of our
papers.
Kind, regards,
Oscar Nierstrasz
%L Miln89a
%K olit concurrency obib(obcp)
%A R. Milner
%T Communication and Concurrency
%I Prentice-Hall
%D 1989
%L Hoar85a
%K olit concurrency book obib(obcp)
%A C.A.R. Hoare
%T Communicating Sequential Processes
%I Prentice-Hall
%D 1985
-------------------------------------------------------------------
Dr. O.M. Nierstrasz | Tel: 41 (22) 787.65.80
University of Geneva | Fax: 735.39.05
Centre Universitaire d'Informatique | Home: 733.95.68
12 rue du Lac, CH-1207 Geneva | E-mail: oscar@cui.unige.ch
SWITZERLAND | oscar@cgeuge51.bitnet
-------------------------------------------------------------------
******************************************************************************
*** end of continued summary ***
Thank you for your input.
Angelika buth@gmdzi.uucp
∂25-May-90 1749 LOGMTC-mailer Logic lunch w/Prof. Feferman: Wed. May 30, 12noon in SRIBN 182
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 25 May 90 17:49:42 PDT
Received: from argon.csl.sri.com by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA00765; Fri, 25 May 90 17:50:46 -0700
Received: by argon.csl.sri.com at Fri, 25 May 90 17:50:44 -0700.
(5.61.14/XIDA-1.2.8.27) id AA02679 for logic@cs.stanford.edu
Date: Fri, 25 May 90 17:50:44 -0700
From: Natarajan Shankar <shankar@csl.sri.com>
Message-Id: <9005260050.AA02679@argon.csl.sri.com>
To: logic@cs.stanford.edu
Subject: Logic lunch w/Prof. Feferman: Wed. May 30, 12noon in SRIBN 182
Prof. Feferman will discuss "Logics of termination and correctness of
functional programs".
Bring your own lunch.
-Shankar
∂26-May-90 0555 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM or, reintegrating,
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 26 May 90 05:55:10 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 517623; 26 May 90 08:22:18 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 125006; Sat 26-May-90 05:20:27 PDT
Date: Sat, 26 May 90 05:20 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: or, reintegrating,
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900526122016.0.RWG@TSUNAMI.SPA.Symbolics.COM>
inf 1 2 n + 1 x
==== E (-) x tanh -
\ 2 n 3 6 6
(D1103) > ------------------------- = ------- atan -------
/ 2 n + 1 sqrt 3 sqrt 3
==== (2 + 1) (2 n + 1)!
n = 0
∂28-May-90 0145 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM Curses, Euled again
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 28 May 90 01:45:18 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 517763; 28 May 90 04:43:33 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 125056; Mon 28-May-90 01:41:50 PDT
Date: Mon, 28 May 90 01:41 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: Curses, Euled again
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900526114641.9.RWG@TSUNAMI.SPA.Symbolics.COM>
Message-ID: <19900528084137.3.RWG@TSUNAMI.SPA.Symbolics.COM>
Date: Sat, 26 May 90 04:46 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
I shoulda differentiated.
inf 1 2 n x
==== E (-) x sinh -
\ 2 n 3 6
(D1075) > --------------------- = ------
/ 2 n + 1 x
==== (2 + 1) (2 n)! sinh -
n = 0 2
Expanding the rhs, and using A&S 23.1.23 gives
1 n 2 2 n+1 1
(D1179) E (-) = (-1) E (-) = ----- ((- 2) - 1) B (-)
n 3 n 3 n + 1 n+1 3
which you can pencil into the subsequent big whitespace.
(C1180) (''(simp:true),makelist(''(subst([E[n]=lambda([x],Eulerpoly(x,n)),B[n+1]=lambda([x],Bernpoly(x,n+1)),""=lambda([x],x)],%)),n,0,9));
1 1 2 2 13 13 22 22 121 121
(D1180) [1 = 1, - - = - -, - - = - -, --- = ---, -- = --, - --- = - ---,
6 6 9 9 108 108 81 81 486 486
602 602 18581 18581 30742 30742 305071 305071
- --- = - ---, ----- = -----, ----- = -----, - ------ = - ------]
729 729 17496 17496 6561 6561 39366 39366
But this is just the x=2/3 case of 23.1.27, so, sorry for all the fuss.
(One last trivium. Radius of conv = 2 pi, which is no greater than if
E[n](1/3) were replaced by max E[n](x), which E[n](1/3) must therefore
0<x<1
~ infinitely often.)
∂28-May-90 1220 LOGMTC-mailer tuesday seminar reminder
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 May 90 12:20:30 PDT
Received: from Sail.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26880; Mon, 28 May 90 12:21:25 -0700
Message-Id: <r#Zf1@SAIL.Stanford.EDU>
Date: 28 May 90 1220 PDT
From: Carolyn Talcott <CLT@SAIL.Stanford.EDU>
Subject: tuesday seminar reminder
To: logic@CS.STANFORD.EDU
Speaker: Lou Galbiati
Title: A Simplifier for Untyped Lambda Expressions
Date: Tuesday 29 May 1990
Time: 4:15pm
Place: 301 Margaret Jacks
∂28-May-90 1408 @Sunburn.Stanford.EDU:anderson@Neon.Stanford.EDU *** CSD SPRING PICNIC ***
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 28 May 90 14:08:22 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27673; Mon, 28 May 90 13:32:03 -0700
Received: from LOCALHOST by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA26642; Mon, 28 May 90 13:32:12 -0700
To: csd-list@sunburn.Stanford.EDU
Subject: *** CSD SPRING PICNIC ***
Date: Mon, 28 May 90 13:32:11 -0700
Message-Id: <26640.643926731@Neon.Stanford.EDU>
From: anderson@Neon.Stanford.EDU
======================= ANNUAL CSD SPRING PICNIC ==========================
It's time for the annual CSD spring picnic!
The festivities are being held at our traditional location --
Pine Grove at Mitchell Park on Friday June 1st (see map below).
Sports (volleyball, softball, etc.) and snacks begin at 2:00pm.
Bring your baseball mitts, softballs, frisbees, lawn darts and croquet
sets.
Our fabulous CSD barbeque will begin at 5:30.
All CSD faculty, students (Ph.D, Masters and Undergrads),
and staff and their guests are invited.
All food and drinks (soft drinks, beer and wine) are being provided courtesy
of the department.
The menu will include barbequed chicken, hamburgers, and vegetarian
shish-kebabs.
So bring yourself and a friend to Mitchell Park Friday. See you then!
Note: We need volunteers to help with the cooking and set up/clean up. Please
send mail to one of the members of the social
committee if you want to participate in this fine CSD tradition.
Your social committee,
Jennifer Anderson anderson@neon
Dan Scales scales@neon
R. Michael Young young@neon
Directions from Stanford:
Turn right on El Camino Real.
Turn left on Oregon/Page Mill.
Turn right on Middlefield (go about 1 mi).
Turn right into Mitchell Park. We will be in the Pine Grove area.
Middlefield |
=======================================================================
| | +-------|-------+
| | | Mitchell |
| | | Park x |
| | | |
| | +---------------+
| | (x marks the spot)
| East Meadow Street -> |
| |
| |
| Alma |
=======================================================================
| |
| <-Oregon Expressway/Page Mill
El Camino |
=======================================================================
|
Stanford |
∂29-May-90 0924 axwang@Theory.Stanford.EDU This week's talk
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 09:23:01 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA00368; Tue, 29 May 90 08:26:51 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA07553; Tue, 29 May 90 08:26:47 -0700
Message-Id: <9005291526.AA07553@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: This week's talk
Date: Tue, 29 May 90 08:26:45 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
The speaker at AFLB this week will be Yitzhak Birk from IBM Almaden.
AFLB will be in MJH 252 on Thursday at 12:00pm.
CONNECTING GRID POINTS TO THE GRID'S BOUNDARY USING
NON-INTERSECTING STRAIGHT LINES
Consider the following problem. Given a set of N points in a
rectangular (mXn) grid; determine whether it is possible to connect
all points to the grid's boundary using N non-intersecting straight
(horizontal or vertical) lines. If such a connection is possible,
provide a legal set of lines. In this talk, we present a sequential
algorithm for solving the problem. Its worst-case time complexity is
the minimum of O(m+n) and O(NlogN). This improves upon a recent
O(N↑2) algorithm by Roychowdhury and Bruck. We then consider two
related topologies: (i) a 3-dimensional grid, and (ii) a 2-dimensional
grid which is partitioned into subgrids. In the latter case, we allow
a connection from at most one of two adjacent subgrids to any given
point on their common boundary. We show that for both topologies the
problem is NP-Complete.
The 2-dimensional problems (with an additional constraint, which we
also address) were originally posed by S.-Y. Kung, S.N Jean and C.W.
Chang in the context of fault-tolerant arrays of standard cells. A
solution to these problems directly provides a reconfiguration
assignment for a certain class of rectangular arrays. This can be
used to increase manufacturing yield of VLSI or WSI arrays and to
reduce the reconfiguration time of operational fault-tolerant arrays.
The partitioned-grid problem is motivated by the fact that for very
large arrays, it is necessary to provide additional rows and columns
of spare cells, since the ratio of total number of cells to spare
cells increases as the array grows (area/perimeter). Additional
applications may include automated assembly and testing.
This is joint work with Jeff Lotspiech
∂29-May-90 1227 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SIGAL Symposium 1990
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 12:24:11 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA00756; Tue, 29 May 90 12:09:57 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28074; Tue, 29 May 90 12:10:33 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16412; Tue, 29 May 90 12:08:07 -0700
Message-Id: <9005291908.AA16412@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4901; Tue, 29 May 90 12:50:29 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
4884; Tue, 29 May 90 12:50:24 CDT
Date: Tue, 29 May 90 13:34:54 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
asano <asano@iscb.osakac.ac.jp>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu, nu021172@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: asano <asano%iscb.osakac.ac.jp@VM1.NoDak.EDU>
Subject: SIGAL Symposium 1990
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
=================================================================
| SIGAL International Symposium on Algorithms |
| |
| August 16 - 18, 1990, Tokyo |
| |
| Organized by Special Interest Group on Algorithms (SIGAL) |
| of the Information Processing Society of Japan (IPSJ) |
=================================================================
Symposium Organization
Symposium Chairs: Akihiro NOZAKI (International Christian University)
Takao NISHIZEKI (Tohoku University)
Program Committee:
Toshihide IBARAKI (Kyoto University) (Chair)
Tetsuo ASANO (Osaka Electro-Comm. University) (Co-Chair)
Takao ASANO (Sophia University)
Yoshihide IGARASHI (Gunma University)
Hiroshi IMAI (Tokyo University)
Kazuo IWANO (IBM Tokyo Research Laboratory)
Tsutomu MATSUMOTO (Yokohama National University)
Tetsuo MIZOGUCHI (Mitsubishi Electric Company, Ltd.)
Katsuhiro NAKAMURA (NEC Co. Ltd.)
Hideo NAKANO (Osaka University)
Masafumi YAMASHITA (Hiroshima University)
Hiroto YASUURA (Kyoto University)
Finance: Katsuhiro NAKAMURA (NEC Co. Ltd.)
Publication, Publicity: Hiroshi IMAI (Tokyo University)
Local Arrangement Committee:
Yoshihide IGARASHI (Gunma University) (Chair)
Takao ASANO (Sophia University) (Co-Chair)
Kazuo HIRONO (CSK Corporation)
Kazuo IWANO (IBM Tokyo Research Laboratory)
Mario NAKAMORI (Tokyo University of Agriculture and Technology)
Takeshi TOKUYAMA (IBM Tokyo Research Laboratory)
Shuji Tsukiyama (Chuo University)
Shuichi UENO (Tokyo Institute of Technology)
Osamu WATANABE (Tokyo Institute of Technology)
GENARAL INFORMATION
Location and Dates
The Symposium will take place at the
CSK Information Education Center
5-1, Suwa-2-chome, Tama, Tokyo 206 JAPAN
on
August 16 (Thursday) through 18 (Saturday), 1990
Language
The official language during the symposium is English.
Registration
All participants, when they arrive at the symposium site, must go to
the registration desk to notify us of your presence and to pick up
the Symposium kit. The registration desk is open according to the
following schedule:
August 15, Wednesday 15:00-20:00
August 16, Thursday - 17, Friday 08:30-20:00
August 18, Saturday 08:30-12:00
Only preregistered participants can attend the Symposium. Those who
are going to participate the Symposium have to fill in the registra-
tion form below and return it with the payment on the registration
fee to:
Prof. Takao ASANO
Department of Mechanical Engineering
Sophia University
Kioicho 7-1, Chiyoda-ku, Tokyo 102, Japan
facsimile: +81-3-238-3885
Symposium fee
No registration will be accepted unless it is accompanied by a correct
payment of the following fee:
with accomodation 40,000 yen (registered until July 5)
with accomodation (with spouse) 70,000 yen (registered until July 5)
without accomodation 20,000 yen (registered until July 5)
without accomodation 25,000 yen (registered on and after
July 6)
'The with accomodation' class includes board, and the 'without
accomodation' class includes lunch. The registration fee includes
participation in all scientific activities and social events. The
registration fee also includes proceedings of the Symposium.
Remittance
Remittance should be made only by a bank transfer to the following
account:
Name of Account: SIGAL-ISA, representative Katsuhiro NAKAMURA
Name of Bank: Mitsui Bank, Miyamaedaira Branch (No.244)
Number of Account: 5232297
Personal checks, bank draft, traveller's checks, and credit cards are
not acceptable.
Hotel Accomodation
CSK Information Education Center, where the Symposium is to be held,
has 140 single rooms, all of which are to be used by the Symposium
attendants. As there are few hotels near the Symposium site, it is
recommended that registrants make reservation in the Center by
choosing 'with accomodation' class in the registration form. Since
the number of rooms is limited, rooms will be assigned on a first-
come-first-served basis, and registrants are kindly requested to send
the registration form at the earliest convenience. CSK Information
Education Center has a swimming pool, a tennis court, an athletic
gymnasium, and saunas, all free for the participant. The check in
time is 15:00 (Wednesday), August 15, and the check out time is 10:00,
August 19 (Sunday).
Visas
Citizens of some countries need to hold a visa to enter Japan. Please
consult your travel agent or the Japanese Consulate as to whether you
need one or not. If a document from the Organizing Committee is
necessary for you to obtain a visa, please write to
Prof. Takao NISHIZEKI
SIGAL Symposium Chairman
Department of Information Engineering,
Faculty of Engineering,
Tohoku University
Sendai 980, Japan
E-mail: nishi@jpntohok.bitnet
facsimile: +81-22-263-9301
as soon as possible, because visa procedures are usually very slow.
Climate and Clothing
Generally speaking, the climate of Tokyo in Summer is hot and humid.
The temperature in August is about 26+-4 degree in Celcius (or 78+-7
degree in Farenheit). Participants are advised to wear light clothing,
such as half-sleeve shirts. However, we recommend that you carry a
light sweater or a jacket, since the Symposium site and the main
transportation systems in Japan are air-conditioned.
SOCIAL EVENTS
Welcoming Reception
All participants and accompanying persons are invited to attend the
Welcoming Reception which will start at 18:00, August 15 (Wednesday)
at the SE Salon in the 7th floor of the Conference Building. Light
meal (e.g. sandwitches) and drinks (wine, beer, or soft drinks) will
be served. The registration fee covers this expense.
Banquet
A Banquet in Buffet STyle will be held at 18:00, August 16 (Thursday)
at the Cafeteria in the Conference Building. All participants and
accompanying persons are invited to attend the banquet. The
registration fee covers this expense.
TRANSPORTATION
From Tokyo International Airport (Narita) to Shinjuku
As there is no means of direct transportation from Tokyo International
Airport at narita to the Symposium site, you have to move first to
Shinjuku Station in Tokyo. Airport Limousine Buses run regularly
between Airport and Shinjuku, leaving the airport every 20 minutes in
the daytime. The bus stop you have to get off is 'Shinjuku Nishiguchi.'
It takes about 120-150 minutes and costs 2,700 yen from the airport to
Shinjuku. (It will cost about 25,000 yen by a taxi, so DO NOT catch
a taxi at Narita airport.) If you are already in Tokyo or you have
taken another bus, go to Shinjuku Station by JR (Japan Railway) train,
subway, or a taxi.
>From Shinjuku to the Symposium Site
The direct transportation from Shinjuku to the Symposium site is Keio
line. When you arrive in Shinjuku, you have to fing 'Keio Shinsen
Shinjuku' (or 'Toei Shinjuku') station. Take a train for 'Tama Center'
or 'Hashimoto' and get off at 'Nagayama' station, from which the
Symposium site is within 5 minutes walk. Note that 'Keio Shinsen
Shinjuku' station is different from 'Keio Shinjuku' station, and if
you have taken a train from the latter, you have to get off at 'Chofu'
station and take another train for Tama Center or Hashimoto. Also
there are many other 'Shinjuku' stations for different lines, so you
have to be careful not to take a train other than Keio line.
Japan Railway Pass
If you have a plan of visiting several cities in Japan, it is
recommended to use the bullet train ('Shinkansen' in Japanese). The
fare is 25,940 yen for a round trip between Tokyo and Kyoto. You can
buy a special discount ticket in you country like EuRail Pass in
Europe (note that you CANNOT buy one in Japan), which is called
'Japan Railway Pass.' The price depends on the period and is about
27,000 yen for one week and 43,000 yen for two weeks. With this pass
you can take any train of Japan Railway freely. You can even reserve
a seat in bullet trains. Please ask your travel agency for detail.
Also, it is advised NOT TO travel for sightseeing in Japan before the
Symposium, especially between the 10th and the 16th in August, since
during this period traffics (trains, highways, airlines, and so on)
are terribly crowded because of religious holidays.
=================================================================
| SIGAL International Symposium on Algorithms |
| |
| August 16 - 18, 1990, Tokyo |
| |
| REGISTRATION FORM |
=================================================================
Please: 1. Fill in one form per participant,
2. Type or print,
3. Keep a copy for your record,
4. Attach a copy of the order of bank transfer, and
5. Mail to Prof. takao ASANO (see below).
Participant:
_Mr. _ Ms. Family name ________________________________________
Given Name(s)________________________________________
Mailing Address:
_Office _Home
Affiliation____________________________________________________
____________________________________________________
Address Street_____________________________________________
City_______________________________________________
Postal Code_____________ Country___________________
Phone___________________
Facsimile_______________
E-mail__________________
Accompanying person: if any
_Mr. _Ms. ______________________________________
Registration Fee (including social events and proceedings):
_with accomodation 40,000 yen (registered until July 5)
_with accomodation (with spouse) 70,000 yen (registered until July 5)
_without accomodation 20,000 yen (registered until July 5)
_without accomodation 25,000 yen (registered on and after
July 6)
Arrival/Departure:
Arrival Date_____________________ Time ____________________
Departure Date_____________________ Time ____________________
I remitted the above amount _______yen on ________________(date) through
_____________________________________(name of bank) to the account of
SIG-SA, representative Katsuhiro Nakamura, A/C No. 5232297 (ordinary
deposit), Miyamaedaira Branch (No. 244), Mitsui Bank and am attaching
hereto a copy of the order.
Date:___________________ Signature:_________________________________
Note: All payments must be made in Japanese Yen. Personal checks, bank
draft, traveller's checks, and credit cards are not acceptable. this
application will become valid upon receipt of confirmation from the
Conference Office. Since we can afford only a limited number of rooms
for accomodation, please registrate at your earliest convenience.
Mail this form form:
------------------------------------------
| Prof. Takao ASANO |
| Department of Mechanical Engineering |
| Sophia University |
| Kioicho 7-1, Chiyoda-ku, Tokyo 102 |
| Japan |
------------------------------------------
A brochure including several maps is available. For the brochure,
please write to or send e-mail to Prof. Takao ASANO, Local Arrangement
Co-chair of the symposium.
---------------------------------------------
| E-MAIL: t_asano@hoffman.cc.sophia.ac.jp |
---------------------------------------------
=================================================================
| SIGAL International Symposium on Algorithms |
| |
| August 16 - 18, 1990, Tokyo |
| |
| PROGRAM |
=================================================================
Thursday, August 16
9:15 Opening of the Symposium
Session I-1: Invited Talk
9:30 Recent Progress in String Algorithms
Z. Galil (Columbia Univ. and Tel Aviv Univ.)
10:30 Break (10 minutes)
Session I-2: Invited Talk
10:40 Selection Networks
N. Pippenger (Univ. of British Columbia)
11:40 LUNCH (90 minutes)
Session A-1
1:10 Computing Edge-Connectivity in Multiple and Capacitated Graphs,
H. Nagamochi and T. Ibaraki (Kyoto Univ.)
1:40 Efficient Sequential and Parallel Algorithms for Planar Minimum
Cost Flow, H. Imai (Univ. of Tokyo) and K. Iwano (IBM Res.,
Tokyo Research Lab.)
Session B-1
1:10 Structural Analysis on the Complexity of Inverting Function,
O. Watanabe (Tokyo Inst. of Technology) and S. Toda (Univ. of
Electro-Communications)
1:40 Oracles versus Proof Techniques That Do Not Relativize*,
E. Allender (Rutgers Univ.)
2:10 Break (20 minutes)
Session A-2
2:30 20-Relative Neighborhood Graphs Are Hamiltonian*, M.S. Chang
(National Chung Cheng Univ.), C.Y. Tang and R.C.T. Lee (National
Tsing Hua Univ.)
3:00 The K-Gabriel Graphs and Their Applications, T.-H. Su (National
Chia Tung Univ.), and R.-C. Chang (National Chia Tung Univ.)
Session B-2
2:30 Parallel Algorithms for Generating Subsets and Set Partitions,
B. Djoki\'{c} (Univ. of Miami), M. Miyakawa, S. Sekiguchi
(Electrotechnical Lab.), I. Semba (Ibaraki Univ.)
and I. Stojmenovi\'{c} (Univ. of Ottawa)
3:00 Parallel Algorithms for Linked List and Beyond*, Y. Han
(Univ. of Kentucky)
3:30} Break (20 minutes)
Session A-3
3:50 Local Tournaments and Recognition of Proper Circular Arc Graphs*,
J. Bang-Jensen (Univ. of Copenhagen), P. Hell and J. Huang
(Simon Fraser Univ.)
4:20 Fast Algorithms for the Dominating Set Problem on Permutation
Graphs, K.-H. Tsai and W.-L. Hsu (Northwestern Univ. and
Academia Sinica)
Session B-3
3:50 Two Probabilistic Results on Merging, W. F. de la Vega (Univ.
Paris-Sud), S. Kannan (Univ. of California, Berkeley) and
M. Santha (Univ. Paris-Sud)
4:20 Randomized Broadcast in Networks, U. Feige , D. Peleg (Weizmann
Inst. of Science), P. Raghavan (IBM T.J. Watson Res. Ctr.)
and E. Upfal (IBM Almaden Res. Ctr.)
6:00 Banquet
---------------------------------------------------------------------
Friday, August 17
Session I-3: Invited Talk
9:30 On the Construction of Abstract Voronoi Diagrams, II
R. Klein (Univ.-GHS-Essen), K. Mehlhorn and S. Meiser
(Univ. des Saarlandes)
10:30 Break (10 minutes)
Session I-4: Invited Talk
10:40 Searching in Higher Dimension
B. Chazelle (Princeton Univ.)
11:40 LUNCH (90 minutes)
Session A-4
1:10 Finding UExtrema with Unary Predicates*,
D. Kirkpatrick and F. Gao (Univ. of British Columbia)
1:40 Implicitly Searching Convolutions and Computing Depth of
Collision*, D. Dobkin (Princeton Univ.), J. Hershberger
(DEC SRC), D. Kirkpatrick (Univ. of British Columbia)
and S. Suri (Bellcore)
Session B-4
1:10 Characterization for a Family of Infinitely Many Irreducible
Equally Spaced Polynomials, T. Itoh (Tokyo Inst. of Technology)
\\[2mm]
1:40 Distributed Algorithms for Deciphering, M. Cosnard and J.-L.
Philippe (Ecole Normale Sup\'{e}rieure de Lyon)
2:10 Break (20 minutes)
Session A-5
2:30 An Efficient Algorithm for Optimal Loop Parallelization,
K. Iwano and S. Yeh (IBM Res., Tokyo Research Lab.)
3:00 Another View on the SSS* Algorithm, W. Pijls and A. de Bruin
(Erasmus Univ. Rotterdam)
Session B-5
2:30 Algorithms from Complexity Theory: Polynomial-Time Operations for
Complex Sets*, L. A. Hemachandra (Univ. of Rochester)
3:00 Complexity Cores and Hard Problem Instances*,
U. Sch\"{o}ning (Univ. Ulm)
3:30 Break (20 minutes)
Session A-6
3:50 Spatial Point Location and Its Applications, X.-H. Tan,
T. Hirata and Y. Inagaki (Nagoya Univ.)
4:20 Sublinear Merging and Natural Merge Sort, S. Carlsson,
C. Levcopoulos and O. Petersson (Lund Univ.)
4:50 Constructing Strongly Convex Approximate Hulls with Inaccurate
Primitives, L. J. Guibas (MIT and Cambridge Research Lab.),
D. Salesin (Stanford Univ.) and J. Stolfi (DEC SRC)
Session B-6
3:50 Computing Puiseux-Series Solutions to Determinantal Equations
via Combinatorial Relaxation, K. Murota (Univ. of Tokyo)
4:20 Complexity of Probabilistic Versus Deterministic Automata*,
R. Freivalds (Latvian State Univ.)
4:50 A Tight Lower Bound on the Size of Planar Permutation Networks*,
M. Klawe (Univ. of British Columbia) and T. Leighton (MIT)
Saturday, August 18
Session I-5: Invited Talk
9:30 Simultaneous Solution of Families of Problems
R. Hassin (Tel Aviv Univ.)
10:30 Break (10 minutes)
Session A-7
10:40 Algorithms for Projecting Points to Give the Most Uniform
Distribution with Applications to Hashing, Te. Asano (Osaka
Electro-Communication Univ.) and T. Tokuyama (IBM Res., Tokyo
Research Lab.)
11:10 Topological Sweeping in Three Dimensions, E.G. Anagnostou
(Univ. of Toronto), L.J. Guibas (MIT and Cambridge Research Lab.)
and V. Polimenis (Univ. of California, Berkeley)
Session B-7
10:40 Finding Least-Weight Subsequence with Few Processors,
K.-F. Chan and T.-W. Lam (Univ. of Hong Kong)
11:10 Derandomization by Exploiting Redundancy and Mutual Independence,
Y. Han (Univ. of Kentucky) and Y. Igarashi (Gunma Univ.)
11:40 LUNCH (90 minutes)
Session A-8
1:10 Planar Separators and the Euclidean Norm, H. Gazit (Duke
University) and G. Miller (Carnegie Mellon Univ. and Univ.
of Southern California)
1:40 On the Complexity of Isometric Embedding in the Hypercube,
D. Avis (McGill Univ.)
Session B-8
1:10 Distributed Function Evaluation in the Presence of Transmission
Faults, N. Santoro (Carleton Univ. and Univ. di Bari), and
P. Widmayer (Freiburg Univ.)
1:40 Optimal Linear Broadcast, S. Bitan and S. Zaks (Technion)
2:10 Break (20 minutes)
Session A-9
2:30 Graph Augmentation Problems for a Specified Set of Vertices,
T. Watanabe, Y. Higashi and A. Nakamura (Hiroshima Univ.)
3:00 A Heuristic for the k-Center Problem with Vertex Weight,
Q. Wang and K.H. Cheng (Univ. of Houston)
Session B-9
2:30 Parallel Convexity Algorithms for Digitized Images on a Linear
Array of Processors, H. M. Alnuweiri (King Fahd Univ. of Petroleum
and Minerals) and V.K. Prasan Kumar (Univ. of Southern California)
3:00 Parallel Algorithms for Labeling Image Components,
W.-J. Hsu and X. Lin (Michigan State Univ.)
3:30 Break (20 minutes)
Session A-10
3:50 A Hyperplane Incidence Problem with Applications to Counting
Distances, H. Edelsbrunner (Univ. of Illinois) and M. Sharir
(New York Univ. and Tel Aviv Univ.)
4:20 Splitting a Configuration in a Simplex, K. Numata (Univ. of
Electro-Communications Univ.) and T. Tokuyama (IBM Res., Tokyo
Research Labs)
4:50 Weaving Patterns of Lines and Line Segments in Space, J. Pach
(New York Univ. and Hungary Academy of Sciences), R. Pollack
(New York Univ.) and E. Welzl (Freie Univ. Berlin)
Session B10
3:50 Efficient Parallel Algorithms for Path Problems in Planar Directed
Graphs, A. Lingas (Lund Univ.)
4:20 Parallel Algorithms for Finding Steiner Forests in Planar Graphs,
H. Suzuki, C. Yamanaka and T. Nishizeki (Tohoku Univ.)
4:50 Optimally Managing the History of an Evolving Forest, V. J. Tsotras
(Columbia Univ.), B. Gopinath (Rutgers Univ.) and G. W. Hart
(Columbia Univ.)
*invited papers
∂29-May-90 1237 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU request
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 12:34:08 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA00785; Tue, 29 May 90 12:19:59 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA28696; Tue, 29 May 90 12:20:41 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16732; Tue, 29 May 90 12:19:19 -0700
Message-Id: <9005291919.AA16732@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9072; Tue, 29 May 90 14:16:22 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
9032; Tue, 29 May 90 14:16:16 CDT
Date: Tue, 29 May 90 14:30:33 -0400
Reply-To: TheoryNet List <THEORYNT@VM1.NoDak.EDU>,
"Victor S. Miller" <VICTOR@IBM.COM>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
From: "Victor S. Miller" <VICTOR%IBM.COM@VM1.NoDak.EDU>
Subject: request
Comments: To: theorynt%dearn.bitnet@cunyvm.cuny.edu
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
add theorynt ads@udsab.dia.unis.it Alfredo de Santis
del theorynt ads%udsab.uucp@inria.inria.fr
∂29-May-90 1242 @Sunburn.Stanford.EDU:pieper@geode.Stanford.EDU CSD Service Award Nominations
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 12:42:00 PDT
Received: from Geode.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16603; Tue, 29 May 90 12:15:17 -0700
Received: by geode.Stanford.EDU (5.57/Ultrix3.0-C)
id AA02753; Tue, 29 May 90 12:14:13 PDT
Date: Tue, 29 May 90 12:14:13 PDT
From: pieper@geode.Stanford.EDU (Karen Pieper)
Message-Id: <9005291914.AA02753@geode.Stanford.EDU>
Subject: CSD Service Award Nominations
Apparently-To: csd-list@sunburn.Stanford.EDU
Nominations are invited for the seventh Computer Science Department
Service Award. The award is given annually by the Computer Science
Department to recognize outstanding student contributions to the
computer science department, based on the recommendations of a
committee composed of past winners of the award. Past winners have
been Jeff Mogul, Joe Weening, Peter Karp, Haym Hirsh, Mike Dixon,
Karen Pieper, and Ramsey Haddad.
Please send Service Award nominations to pieper@cs, and include
a description of the qualifications of the nominee.
Thank you!
Karen Pieper, on behalf of
the Service Award Committee
∂29-May-90 1245 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Splitting FOCS
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 12:43:01 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA00805; Tue, 29 May 90 12:28:49 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA29381; Tue, 29 May 90 12:29:35 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16791; Tue, 29 May 90 12:28:11 -0700
Message-Id: <9005291928.AA16791@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 9527; Tue, 29 May 90 14:26:18 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
9494; Tue, 29 May 90 14:26:15 CDT
Date: Tue, 29 May 90 15:21:30 -0400
Reply-To: John Cherniavsky <jcc%mimsy.umd.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu, nu021172@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: John Cherniavsky <jcc%mimsy.umd.edu@VM1.NoDak.EDU>
Subject: Re: Splitting FOCS
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <9005251846.AA04325@irt.watson.ibm.com>, gillies@P.CS.UIUC.EDU
writes:
> > I have a problem with *that*! The AMS (to which I also belong)
> > makes much more of an effort to hold down the costs of attending
> > their conferences. (They often hold them at college campuses,
> > and also include some weekend days, presumably so that those
> > attending can get cheap airfares.)
>
> It is surprising the way computer scientists can throw their
> conference money around. Recently, the 4th Annual Conference on
> Computational Geometry was held on this campus. All the lectures were
> given in the campus performing arts center.
>
> The cost of registration was over $200, and many mathematicians from
> the U of Illinois chose not to attend because of the high registration
> cost. It seems most math conferences cost $100 to register, at the
> very most. The funding glut in C.S. may not last forever.
>
>
The only difference between the AMS conferences and the Computer Science
conferences regarding the registration fees is what is bundled in with
the registration fees. Typically the cost of break refreshments and
lunches and a banquet are included in CS conference registration fees -
these are not included within the registration fee of most AMS meetings.
When the CS community began its STOC/FOCS conferences the number of
attendees was much smaller. It was felt, for social reasons, that having
common lunches was a good place to encourage collaborative research (
which is the argument used for funding student lunches at STOC and FOCS).
A secondary reason (at least in the early 70's) was as a means for
getting around low per diem allowances at some of the State universities.
The universities would pay registration fees without a quibble and then
allow, say $35/day, for all lodging and meal expenses. By bundling some
of the meals into the registration fee, attendees would not be out
too much pocket money.
One final, though not compelling, reason to include such lunches in the
registration fee is that buying lunches and breaks from the hotel gives
the conference organizer leverage in negotiating both room rates and
the free use of lecture facilities. Its been my experience that the
major costs of recent conferences has been the room rates and the
travel costs with the registration fees third - there is certainly
something to be said for a low cost conference (dorm rooms, meal plan
meals) and in this era of tight money, the conference organizers
should attempt to hold more of them - just let your umbrella
organization (the TC or the SIGACT Exec. Comm. or whatever) know
your wishes - its you (the attendees) who are the conference.
John C. Cherniavsky
∂29-May-90 1629 marx@sierra.Stanford.EDU Recommendations for Outstanding Service Award
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 16:29:09 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 29 May 90 16:26:18 PDT
Date: Tue, 29 May 90 16:26:18 PDT
From: marx@sierra.Stanford.EDU (Marianne L. Marx)
To: ee-faculty@sierra, ee-administration@sierra
Cc: marx@sierra.Stanford.EDU
Subject: Recommendations for Outstanding Service Award
Message-Id: <CMM.0.88.644023577.marx@>
An Outstanding Service Award for a graduate student, will be presented at
commencement exercises. The award will be based on nominations by faculty
and staff. Please let us have any recommendations, accompanied by a brief
description of the outstanding service performed, no later than Tuesday, June
5th. Thank you.
Marianne Marx
McCullough160
e-mail: marx@sierra
∂29-May-90 1812 LOGMTC-mailer Logic Lunch w/Sol Feferman at 12noon wed. May 30 in SRI BN182
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 18:12:06 PDT
Received: from argon.csl.sri.com by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28210; Tue, 29 May 90 18:13:06 -0700
Received: by argon.csl.sri.com at Tue, 29 May 90 18:12:55 -0700.
(5.61.14/XIDA-1.2.8.27) id AA03589 for jcm@cs.stanford.edu
Date: Tue, 29 May 90 18:12:55 -0700
From: Natarajan Shankar <shankar@csl.sri.com>
Message-Id: <9005300112.AA03589@argon.csl.sri.com>
To: cslstaff@csl.sri.com, konolige@ai.sri.com, israel@ai.sri.com,
waldinger@ai.sri.com, perrault@ai.sri.com, stickel@ai.sri.com,
dalrymple@ai.sri.com, glb@sail.stanford.edu, suaya@sri.com,
winkler@csl.sri.com, wolfe@CS.Stanford.EDU, scedrov@csli.stanford.edu,
jcm@cs.stanford.edu, fernando@csli.stanford.edu, rtc@sail.stanford.edu,
conal@sun.edu, jdan@sun.com, logic@cs.stanford.edu
Subject: Logic Lunch w/Sol Feferman at 12noon wed. May 30 in SRI BN182
Sol Feferman will discuss "Logics for termination and correctness of
functional programs". Bring your lunch.
For visitors: SRI International is at 333 Ravenswood in Menlo Park.
Please register at the reception of Bldg. A and ask for Shankar
(859-5272). Visitors from east bloc countries should call ahead.
∂29-May-90 1843 LOGMTC-mailer Seminar in logic (reminder)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 18:43:19 PDT
Received: from CSLI.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28725; Tue, 29 May 90 18:44:19 -0700
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA29605; Tue, 29 May 90 18:45:46 PDT
Date: Tue, 29 May 1990 18:45:45 PDT
From: Sol Feferman <sf@csli.Stanford.EDU>
To: logic@cs.stanford.edu
Subject: Seminar in logic (reminder)
Message-Id: <CMM.0.88.644031945.sf@csli.stanford.edu>
Prof. Rick Sommer of Stanford will be speaking on "Fast growing functions
and fragments of arithmetic" on Wed. May 30 , 4:15-5:30 PM in room
383N (3d floor Math Lounge).
∂29-May-90 1854 LOGMTC-mailer Real-time verification talk
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 29 May 90 18:54:09 PDT
Received: from linz.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA28866; Tue, 29 May 90 18:55:10 -0700
Received: by linz.stanford.edu (5.59/25-eef) id AA00244; Tue, 29 May 90 18:56:20 PDT
Message-Id: <9005300156.AA00244@linz.stanford.edu>
To: csd@cs.Stanford.EDU, logic@cs.Stanford.EDU, dill@amadeus.Stanford.EDU,
zm@hudson.Stanford.EDU
Subject: Real-time verification talk
Reply-To: tah@cs.Stanford.EDU
Date: 29 May 90 18:56:15 PDT (Tue)
From: Tom Henzinger <tah@linz.Stanford.EDU>
Date: Thursday, May 31.
Time: 10:30 - 11:30 am
Place: MJH 301
Speaker: Rajeev Alur
There will be two talks, each 20 minutes long.
Both the talks will be given at LICS next week.
Real-time Logics: Complexity and Expressiveness
Rajeev Alur, Thomas Henzinger
Abstract:
The theory of the natural numbers with linear order and monadic
predicates underlies propositional linear temporal logic.
To study temporal logics for real-time systems, we combine this
classical theory of infinite state sequences with a theory of time,
via a monotonic function that maps every state to its time.
The resulting theory of {\it timed\/} state sequences is shown
to be decidable, albeit nonelementary, and its expressive power
is characterized by $\omega$-regular sets.
Several more expressive variants are proved to be highly undecidable.
This framework allows us to classify a wide variety of real-time
logics according to their complexity and expressiveness.
In fact, it follows that most formalisms proposed in the literature
can not be decided.
We are, however, able to identify two elementary real-time temporal
logics as expressively complete fragments of the theory of timed
state sequences, and give tableau-based decision procedures.
Consequently, these two formalisms are well-suited for the specification
and verification of real-time systems.
Model-checking for Real-time Systems
Rajeev Alur, Costas Courcoubetis, David Dill
Abstract:
Model-checking is a method of verifying concurrent systems in which
a state-graph model of the system behavior is compared with a
temporal logic formula.
This paper extends \ctl\ model-checking to the analysis of {\it real-time\/}
systems, whose correctness depends on the magnitudes of the
timing delays.
For specifications, we extend the syntax of \ctl\ to allow
quantitative temporal operators such as $\exists\Diamond_{<5}$.
The formulas of the resulting logic, \tctl, are interpreted over
{\em continuous computation trees\/}, trees in which paths are maps
from the set of nonnegative reals to system states.
To model finite-state systems we introduce the notion of {\em timed graphs\/}
--- state-transition graphs extended with a mechanism that
allows the expression of constant bounds on the delays between
the state transitions.
As our main result, we develop an algorithm for model-checking, that is,
for determining the truth of a \tctl-formula with respect to a timed graph.
We argue that choosing a dense domain, instead of a discrete domain, to
model time, does not blow up the complexity of the model-checking problem.
On the negative side, we show that the denseness of the underlying time
domain makes \tctl\ $\Pi_1↑1$-hard.
The question of deciding whether a given
\tctl-formula is implementable by a timed graph is also undecidable.
∂30-May-90 0754 chandler@Sunburn.Stanford.EDU Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 May 90 07:54:45 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA05896; Wed, 30 May 90 07:55:33 -0700
Date: Wed, 30 May 1990 7:55:32 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: tenured@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Faculty Meeting
Message-Id: <CMM.0.88.644079332.chandler@Sunburn.Stanford.EDU>
Please be advised that there will be a senior facuty meeting next Tuesday,
June 5, at 2:30 in MJH-146 to consider the appointments of Nick Trefethen and
Linda Petzold. I should have copies of their letters in my office by Friday
for your perusal.
∂30-May-90 0932 LOGMTC-mailer MSRI Workshop Announcements, Jun 4-8
Received: from lbl.gov by SAIL.Stanford.EDU with TCP; 30 May 90 09:32:45 PDT
Received: from msri.org (mobius.msri.org) by lbl.gov (4.1/1.39)
id AA04098; Wed, 30 May 90 09:30:38 PDT
Received: by msri.org (4.0/SMI-4.0)
id AA26396; Wed, 30 May 90 09:28:48 PDT
Date: Wed, 30 May 90 09:28:48 PDT
From: david@msri.org (David Mostardi)
Message-Id: <9005301628.AA26396@msri.org>
To: weekly@msri.org
Subject: MSRI Workshop Announcements, Jun 4-8
MATHEMATICAL SCIENCES RESEARCH INSTITUTE
1000 CENTENNIAL DRIVE * BERKELEY, CA 94720 * (415) 642-0143
Semnar Announcements for June 4 - 8, 1990
Workshop on Model Theory
Speakers and Titles follow as scheduled.
Tea breaks are at 10:30-11:00 and 3:15-4:00.
Lunch is at 12 noon until 1:20 Tuesday and Thursday.
Lunch is 12 noon until 2:10 on Monday, Wednesday and Friday
*** Monday
Monday 9:30 - 10:30
Wood "Amalgamation classes"
Monday 11:00 - 12:00
Thomas "Canonical expansions of omega-categorical structures"
Monday 2:15-3:15
Cherlin "Pseudo finite structures" (Monday)
Monday 4:00-5:00
Hrushovski "The spectrum functions" I
*** Tuesday
Tuesday 9:30 - 10:30
Buechler "Vaught's conjecture for unidimensional theories" I
Tuesday 11:00 - 12:00
Pheidas "Definability and undecidability for fields of rational functions"
Tuesday 1:20 - 2:10
Laskowski "On extending elementary maps to automorphisms"
Tuesday 2:20 - 3:10
Macintyre "TBA"
*** Wednesday
Wednesday 9:30 - 10:30
Buechler "Vaught's conjecture for unidimensional theories" II
Wednesday 11:00 - 12:00
Pudlak "Some model constructions in bounded arithmetic"
Wednesday 2:15 - 3:15
Rubin "The reconstruction of trees from their automorphism groups"
Wednesday 4:00 - 5:00
Hart "Varieties with few models"
Wednesday 6:30 p.m. There will be wine and cheese served at the Heyns room of the
Faculty Club on UC Berkeley Campus.
*** Thursday
Thursday 9:30 - 10:30
Poizat "Equations generiques"
Thursday 11:00 - 12:00
Valeriote "Tame congruence theory"
Thursday 1:20 - 2:10
Marker "Reducts of algebraically closed fields"
Thursday 2:20 - 3:10
Lachlan "Tree-decomposable structures"
Thursday 4:00-5:00
Hrushovski "The spectrum functions" II
*** Friday
Friday 9:30 -10:30
Bouscaren "Constructing groups in 1-based structures"
Friday 11:00 - 12:00
Pillay "Differential fields"
Friday 2:15 - 3:15
Cherlin "Vive la difference" (Friday)
Friday 4:00 - 5:00
Van den Dries "Embedding problems for henselian fields"
*** Saturday
U. C. Berkeley-- Givant, Craig and Henkin organizers
"Connections between model theory and algebraic logic"
∂30-May-90 1345 LOGMTC-mailer Knuth-Bendix
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 May 90 13:45:25 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15735; Wed, 30 May 90 13:46:31 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA02296; Wed, 30 May 90 13:46:46 PDT
Date: Wed, 30 May 90 13:46:46 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9005302046.AA02296@coraki.stanford.edu>
To: logic@cs.Stanford.EDU
Subject: Knuth-Bendix
Can anyone point me at an implementation of Knuth-Bendix? C, Common
Lisp, or ML would be fine.
-v
∂30-May-90 1642 ingrid@russell.Stanford.EDU CSLI Calendar, 31 May, vol. 5:30
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 30 May 90 16:42:45 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA11784; Wed, 30 May 90 16:06:18 PDT
Date: Wed, 30 May 90 16:06:18 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005302306.AA11784@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 31 May, vol. 5:30
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
31 May 1990 Stanford Vol. 5, No. 30
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 31 MAY 1990
12:00 noon TINLunch
Cordura 100 Spatial Mental Models
Barbara Tversky
Department of Psychology
Stanford University
(bt@psych.stanford.edu)
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 7
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Propositional Attitudes and Russellian
Propositions
Speaker: Robert C. Moore
Artificial Intelligence Center, SRI International
(bmoore@ai.sri.com)
Abstract in last week's Calendar
____________
CSLI ACTIVITIES FOR NEXT THURSDAY, 7 June 1990
12:00 noon TINLunch
Cordura 100 Computers and Musical Structure
Jonathan F. Hallstrom
Department of Music
Colby College
(visiting CCRMA)
(colby!jfhallst@uunet.uu.net)
Abstract below
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 8
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Possible Worlds Semantics and Situation
Semantics
Stanley Peters
Abstract below
____________
NEXT WEEK'S TINLUNCH
Computers and Musical Structure
Jonathan F. Hallstrom
Music, like language, is much more than the sum of its parts. Yet
musicians traditionally spend the bulk of their training learning only
those parts (scales, intervals, etc.), with little time devoted to
addressing in any firsthand fashion how the parts combine to make the
musical structures that we actually hear when we listen to music. The
ability of computers to create and manipulate musical "macros" (e.g.,
motives, phrases, sections, etc.) provides interesting opportunities
for a deepened understanding of how music really works.
____________
NEXT WEEK'S CSLI SEMINAR
Controversies in Natural-Language Research 8
Possible Worlds Semantics and Situation Semantics
Stanley Peters
Stanley Peters will present arguments for advantages of situation
semantics relative to possible worlds semantics in analyzing such
"generalized modal" notions as conditionals and attitudes. The two
semantic approaches take quite different strategies to explaining
phenomena such as the limited transitivity of conditionals, and Peters
will show, for instance, that possible worlds semantics requires
certain apparently false conditionals to be true, while situation
semantics does not.
Mark Gawron will respond briefly in support of possible worlds
semantics, to initiate general discussion of the issues raised.
____________
SYMBOLIC SYSTEMS FORUM
Thursday, 31 May, 4:15 p.m.
Building 60, Room 61G
Seniors in the Symbolic Systems honors program present their work.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Natural Right, Absolutism, and Political Obligation
Pasquale Pasquino
Centre National de la Recherche Scientifique, Paris
Friday, 1 June, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
LINGUISTICS DEPARTMENT COLLOQUIUM
Formal Phonology
(dissertation proposal)
Andra's Kornai
(kornai@csli.stanford.edu)
Friday, 1 June, 3:30 p.m.
Cordura 100
More than ten years after the pioneering work of Leben (1973),
Williams (1971, 1976), Goldsmith (1976), Clements (1976), McCarthy
(1979), and many others, fundamental questions relating to the basic
assumptions, notions, and utility of autosegmental phonology have
still not received satisfactory answers. For example, it is not yet
determined what a well-formed autosegmental representation should be;
what a well-formed rule or a properly stated constraint would look
like; or what the denotation of the autosegmental notation should be
taken to be.
Even more disturbing, whether it is important to answer these
questions is not at all certain, since even more important issues
relating to the inherent usefulness of autosegmental phonological
theory remain unresolved. To date, there is no theoretical proof that
autosegmental phonology is more (or less) powerful than linear (SPE)
phonology. Furthermore, no practical demonstration in the form of a
speech recognition/synthesis application has shown autosegmental
phonology to be superior to linear phonology. On the contrary. Systems
based on more sophisticated linguistic theories -- including
autosegmental phonology -- have been outperformed at every turn by
Hidden Markov speech recognition devices. Such models, based on the
completely discredited (Chomsky 1957) finite state model of language
production, have made tremendous gains, from 60% (Lowerre 1976) to 96%
(Lee 1989) recognition accuracy, and are now the undisputed industry
standard.
This thesis explores the possibility of turning autosegmental
phonology into a theory useful for speech recognition. A
formalization of autosegmental phonology is undertaken in order to
establish that sophisticated nonlinear notation has the same
generative capacity as the mundane finite state mechanism. In order to
demonstrate the usefulness (if any) of autosegmental ideas, I
introduce a class of of Markov-like models that have their structure
determined by "feature geometry" constraints.
The central empirical issue of the thesis is timing. Autosegmental
theory assumes that phonetic events and subevents are concatenated in
a nonlinear manner (permitting a certain amount of desynchronization
among tiers), while Markov models assume simple (linear)
concatenation. While the duration characteristics of individual
phones are predicted to follow the same (Gamma) distribution in both
models, autosegmental theory offers the possibility of making the
parameters of the model more perspicuous.
The main theoretical contribution of the thesis is the formalization
of autosegmental phonology that fulfills two functions. On the one
hand, it opens the way for a theoretical assessment of autosegmental
theory in terms of mathematical linguistic (generative capacity) and
information-theoretic (channel capacity) results. On the other hand,
the formalization links autosegmental theory to Markov modeling, and
thus makes it possible to evaluate competing versions of autosegmental
theory in a new, nontypological fashion.
____________
PHONOLOGY WORKSHOP
Polytonicity
Ove Lorentz
University of Tromso, Norway
(visiting UC Santa Cruz)
(lorentz@ucscc.uscs.edu)
Tuesday, 5 June, 7:30 p.m.
Ventura 17
Polytonic languages, according to Jakobson (1931) (TCLP 4), have
different tone sequences assigned to morae in stressed syllables. It
is usually assumed that such a distinction is present in the lexicon
in languages with polytonic stress (tonal accent), such as
Scandinavian or Serbo-Croatian, but not in monotonic languages, such
as English.
In this talk, I will present an alternative analysis of Scandinavian
polytonicity, which factors out one tone as a default tone given to
syllables with primary stress by a rule of the postlexical phonology.
Such a default tone is also assigned in English and other monotonic
languages. The default tone is found in both accent 1 and accent 2
words in Scandinavian, but only accent 2 words bear lexical tone.
The assignment of a default primary stress tone to a word already
bearing a lexical tone has interesting effects. One is the so-called
delayed tone-effect, which is thus accounted for. In the case of
similar tones we see OCP-related buffering effects. One of the
several phenomena that illustrates this is the so-called double-peaked
accent of many dialects. Docking of tones subject to expulsion from
primary stressed syllables, has repercussions for parametric theory,
which will be briefly discussed.
An attempt will also be made to extend the analysis to other languages
with lexical tone specifications, such as Chinese.
____________
POETICS WORKSHOP
Unstressed Syllables in the Rhythmic Patterns of
Contemporary Russian Verse
Vycheslav Ivanov
Moscow University
Thusday, 7 June, 4:00 p.m.
Ventura 17
This talk, which was scheduled for 29 May, had to be postponed to this
new date.
____________
∂31-May-90 0058 grundy@csli.Stanford.EDU Last Symbolic Systems Forum of the year, 5-31-90
Received: from csli.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 00:58:19 PDT
Received: by csli.Stanford.EDU (4.1/inc-1.0)
id AA19723; Thu, 31 May 90 00:51:49 PDT
Date: Thu 31 May 90 00:51:48-PDT
From: Bill Grundy <GRUNDY@CSLI.Stanford.EDU>
Subject: Last Symbolic Systems Forum of the year, 5-31-90
To: grundy@csli.Stanford.EDU
Message-Id: <644140308.0.GRUNDY@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
SYMBOLIC SYSTEMS FORUM
Thursday, May 31, 1990
Building 60, Room 61-G, 4:15 pm
In this final Symbolic Systems Forum of the year, two
senior Symbolic Systems majors will present summaries of
their honors theses. The topics are as follows:
Ann Podlozny:
Meaning and Information in Dramatic Art: Possible Worlds
and their Applications in Dramatic Logic
Ron Keesing:
Evolution and Learning in Neural Networks: The Number and
Distribution of Learning Trials Affect the Rate of Evolution
Students considering completing honors theses of their
own are especially encouraged to attend this meeting.
There will also be an organizational meeting afterward
to plan some of next year's forum activities.
-------
∂31-May-90 1010 jezuk@sierra.Stanford.EDU Gorbachev T-Shirts
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 10:09:57 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Thu, 31 May 90 10:04:28 PDT
Date: Thu, 31 May 90 10:04:28 PDT
From: jezuk@sierra.Stanford.EDU (Joseph A. Jezukewicz)
To: ee-faculty@sierra.Stanford.EDU, ee-adminlist@sierra.Stanford.EDU
Subject: Gorbachev T-Shirts
Message-Id: <CMM.0.88.644173464.jezuk@>
Hi Folks,
For Gorbachev's visit, I have had some t-shirts made up and they are for sale
for $10 in my office, AEL 118. They are a very attractive souvenir.
Cheers,
Joe
∂31-May-90 1018 wheaton@Sunburn.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 10:17:54 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA07502; Thu, 31 May 90 09:57:14 -0700
Date: Thu, 31 May 90 09:57:14 -0700
From: George Wheaton <wheaton@Sunburn.Stanford.EDU>
Message-Id: <9005311657.AA07502@Sunburn.Stanford.EDU>
To: csdlist@Sunburn.Stanford.EDU, csd.bboard@Sunburn.Stanford.EDU
MONDAY CLOSURE OF MARGARET JACKS HALL
Because of security concerns during President Gorbachev's visit to
Stanford, ALL MAIN QUAD BUILDINGS, INCLUDING MJH, WILL BE CLOSED from 6:00
PM, Sunday, June 3 to approximately 1:00 PM, Monday, June 4. In addition,
there will be no parking on Monday in the Oval, Museum Way, or the
Arboretum until his motorcade leaves at 1:00.
On Monday afternoon CSD will be open as usual, although traffic and parking
may be difficult for a while. Those who want to take the entire day off
should use vacation or PTO.
Other arrangements must be made for Monday morning classes normally held in
Quad classrooms, but 1:15 classes will go ahead as usual. A message from
the Registrar describes class scheduling in more detail.
gw
∂31-May-90 1053 @Sunburn.Stanford.EDU:anderson@Neon.Stanford.EDU CSD Spring Picnic Reminder
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 10:53:04 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08639; Thu, 31 May 90 10:30:50 -0700
Received: from LOCALHOST by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25669; Thu, 31 May 90 10:30:50 -0700
To: csd-list@sunburn.Stanford.EDU, csd.bboard@sunburn.Stanford.EDU
Subject: CSD Spring Picnic Reminder
Date: Thu, 31 May 90 10:30:49 -0700
Message-Id: <25667.644175049@Neon.Stanford.EDU>
From: anderson@Neon.Stanford.EDU
CSD SPRING PICNIC '90
---------------------
Just a reminder that the CSD spring picnic is TOMORROW, Friday June 1st.
The location is Pine Grove at Mitchell Park on Middlefield and East
Meadow in Palo Alto (see map below).
Sports (volleyball, softball, etc.) and snacks begin at 2:00pm.
The barbeque will begin at 5:30.
*All* CSD faculty, students (Ph.D, Masters and Undergrads), and staff AND
their guests are invited.
See y'all there!
Your social committee,
Jennifer Anderson anderson@neon
Dan Scales scales@neon
R. Michael Young young@neon
Middlefield |
=======================================================================
| | +-------|-------+
| | | Mitchell |
| | | Park x |
| | | |
| | +---------------+
| | (x marks the spot)
| East Meadow Street -> |
| |
| |
| Alma |
=======================================================================
| |
| <-Oregon Expressway/Page Mill
El Camino |
=======================================================================
|
Stanford |
∂31-May-90 1126 ingrid@russell.Stanford.EDU Computer Science Department Colloquium, Tuesday, 5 June
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 11:26:45 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA19762; Thu, 31 May 90 10:40:31 PDT
Date: Thu, 31 May 90 10:40:31 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9005311740.AA19762@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: Computer Science Department Colloquium, Tuesday, 5 June
COMPUTER SCIENCE DEPARTMENT COLLOQUIUM
Compiling for High Performance on the Intel Touchstone
Ken Kennedy
Center for Research on Parallel Computation
Rice University
Tuesday, 5 June, 4:15 p.m.
Jordan Hall, Bldg. 420, Room 040
The Intel Touchstone project, sponsored by DARPA, will build a
distributed-memory multicomputer in which each of the 1024 processors
is an Intel i860. This talk addresses two compiler challenges for
this machine.
(1) Although each node of the machine has a peak speed of over sixty
single-precision megaflops, it is difficult to achieve even half
this figure using hand-coded assembly language. Furthermore, code
generated by the currently available compilers usually executes at
less than a twentieth of peak.
(2) To use parallelism, programs must be recoded in a variant of
Fortran with explicit communications. Most scientists find this
style of programming awkward and tedious, preferring the
shared-memory programming paradigm used on sequential and
shared-memory parallel machines.
The Center for Research on Parallel Computation has embarked on a
project to address these two problems. First, we are developing a new
compiler for the i860 that employs a blend of high-level and low-level
techniques to generate very efficient code. Our simulations indicate
that these techniques can lead to code that is up to fifteen times
faster than that generated by naive compilers. This work also
suggests that the achievable performance of the machine might be
doubled by a few simple architectural changes.
Second, we are implementing compiler for a version of Fortran that has
been extended to accommodate distributed memory programming. In this
dialect, the programmer produces a shared-memory sequential Fortran
program, along with a set of annotations that describe how the data
structures are to be laid out in the distributed memories of the
multicomputer. Our compiler uses these annotations to generate a
low-level Fortran program, complete with all the communication
required to insure correctness. We expect that this approach will
produce a parallel program of acceptable efficiency for about
seventy-five percent of scientific programs.
The talk will present the technical approaches being used in the
project and assess its prospects for success.
∂31-May-90 1304 chandler@Sunburn.Stanford.EDU NSF Annual Report (1989)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 13:04:48 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13256; Thu, 31 May 90 13:05:06 -0700
Date: Thu, 31 May 1990 13:05:05 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: NSF Annual Report (1989)
Message-Id: <CMM.0.88.644184305.chandler@Sunburn.Stanford.EDU>
I have one copy of the NSF Annual Report in my office.
∂31-May-90 1342 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM Neural Network Seminar
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 31 May 90 13:42:41 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Thu, 31 May 90 13:40:56-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Thu, 31 May 90 13:40:12 PDT
Date: Thu, 31 May 90 13:44 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: Neural Network Seminar
To: complex-systems@Warbucks.AI.SRI.COM
Message-ID: <19900531204421.5.BERGMAN@HUXLEY.AI.SRI.COM>
Reminder
Neural Network applied to gas and oil Industry
by
Jeff Baldwin
Halliburton, Houston, TX
Presentation: 10-11 am
Discussion: 11-11.30 am
SRI-International
PS-108
∂31-May-90 1348 chandler@Sunburn.Stanford.EDU Renewing U.S. Mathematics
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 13:48:33 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14976; Thu, 31 May 90 13:48:46 -0700
Date: Thu, 31 May 1990 13:48:45 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Renewing U.S. Mathematics
Message-Id: <CMM.0.88.644186925.chandler@Sunburn.Stanford.EDU>
I have the subject publication (Renewing U.S. Mathematics...A Plan for the
1990's....Executive Summary" put out by the Board on Mathematical Sciences,
National Research Council. I will be happy to send you a copy.
∂31-May-90 1426 stager@Sunburn.Stanford.EDU Winter Quarter Tau Beta Pi Survey Results
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 14:25:58 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA16168; Thu, 31 May 90 14:23:18 -0700
Date: Thu, 31 May 1990 14:23:18 PDT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Cc: stager@Sunburn.Stanford.EDU
Subject: Winter Quarter Tau Beta Pi Survey Results
Message-Id: <CMM.0.88.644188998.stager@Sunburn.Stanford.EDU>
The Winter Quarter Tau Beta Pi survey results have just arrived, and should
be delivered to your mail boxes in the next couple days.
Claire
∂31-May-90 1454 chandler@Sunburn.Stanford.EDU NSF Publication
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 14:54:19 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17588; Thu, 31 May 90 14:51:24 -0700
Date: Thu, 31 May 1990 14:51:21 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: NSF Publication
Message-Id: <CMM.0.88.644190681.chandler@Sunburn.Stanford.EDU>
I have just received a publication from NSF entitled "SMALL BUSINESS
INNOVATION RESEARCH (SBIR)" Program Announcement from the National Science
Foundation. It's a bit too "pagey" to duplicate. Feel free to come by my
office and look at it.
∂31-May-90 1544 mps@Sunburn.Stanford.EDU Card
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 31 May 90 15:44:07 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA20222; Thu, 31 May 90 15:43:35 -0700
Date: Thu, 31 May 1990 15:43:35 PDT
From: "Mary P. Simmons" <mps@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, phd@Sunburn.Stanford.EDU,
staff@Sunburn.Stanford.EDU,
"|/usr/ucb/vacation littell"@Sunburn.Stanford.EDU,
"|/usr/ucb/vacation sloan"@Sunburn.Stanford.EDU, IAM@sail.Stanford.EDU,
Pehoushek@gang-of-four.Stanford.EDU, Pollock@sunburn.Stanford.EDU,
littell@Sunburn.Stanford.EDU, sloan@Sunburn.Stanford.EDU,
tom@Sunburn.Stanford.EDU, albert@sunburn.Stanford.EDU,
ariadne@eclipse.Stanford.EDU, baldwin@Sunburn.Stanford.EDU,
bergman@sunburn.Stanford.EDU, bjr@sunburn.Stanford.EDU,
chandler@sunburn.Stanford.EDU, clt@sail.Stanford.EDU,
dale@Sunburn.Stanford.EDU, damon@Sunburn.Stanford.EDU,
davis@sunburn.Stanford.EDU, dean@patience.Stanford.EDU,
ertem@Sunburn.Stanford.EDU, ews@pescadero.Stanford.EDU,
farhad@tehran.Stanford.EDU, gilberts@sunburn.Stanford.EDU,
ginsberg@sunburn.Stanford.EDU, gotelli@Sunburn.Stanford.EDU,
grossman@sunburn.Stanford.EDU, mary@patience.Stanford.EDU,
me@sail.Stanford.EDU, merryman@sunburn.Stanford.EDU,
mps@gang-of-four.Stanford.EDU, napier@sunburn.Stanford.EDU,
olender@sunburn.Stanford.EDU, singh@hudson.Stanford.EDU,
siroker@eclipse.Stanford.EDU, taleen@sunburn.Stanford.EDU,
val@sail.Stanford.EDU, weening@gang-of-four.Stanford.EDU,
wheaton@sunburn.Stanford.EDU, winkler@sunburn.Stanford.EDU
Subject: Card
Message-Id: <CMM.0.88.644193815.mps@Sunburn.Stanford.EDU>
There is a card at the reception desk for anyone to sign. It will be given to Joe
before he leaves CSD.
Pat
∂31-May-90 1612 @IU.AI.SRI.COM,@Warbucks.AI.SRI.COM:BERGMAN@AI.SRI.COM NN talk *DATE*
Received: from IU.AI.SRI.COM by SAIL.Stanford.EDU with TCP; 31 May 90 16:12:45 PDT
Received: from Warbucks.AI.SRI.COM by IU.AI.SRI.COM via SMTP with TCP;
Thu, 31 May 90 14:25:30-PST
Received: from HUXLEY.AI.SRI.COM by Warbucks.AI.SRI.COM with INTERNET ;
Thu, 31 May 90 14:24:20 PDT
Date: Thu, 31 May 90 14:28 PDT
From: BERGMAN@Warbucks.AI.SRI.COM (Aviv Bergman)
Subject: NN talk *DATE*
To: complex-systems@Warbucks.AI.SRI.COM
Message-ID: <19900531212830.6.BERGMAN@HUXLEY.AI.SRI.COM>
Reminder
Neural Network applied to gas and oil Industry
by
Jeff Baldwin
Halliburton, Houston, TX
Presentation: 10-11 am *** June 6 ***
Discussion: 11-11.30 am
SRI-International
PS-108
∂01-Jun-90 0749 chandler@Sunburn.Stanford.EDU June 5 Senior Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 07:49:36 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA01165; Fri, 1 Jun 90 07:50:21 -0700
Date: Fri, 1 Jun 1990 7:50:20 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: tenured@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU, pollock@Sunburn.Stanford.EDU
Subject: June 5 Senior Faculty Meeting
Message-Id: <CMM.0.88.644251820.chandler@Sunburn.Stanford.EDU>
Please be sure your calendars are marked for next Tuesday's faculty
meeting.....2:30 in MJH-146.
I have copies of the letters received to date for Trefethen and Petzold.
PLEASE TAKE TIME TO COME BY MY OFFICE AND READ THEM.
Thanks much.
∂01-Jun-90 0849 chandler@Sunburn.Stanford.EDU Proposal Invitation-Integrated Manufacturing
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 08:49:04 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA03551; Fri, 1 Jun 90 08:48:49 -0700
Date: Fri, 1 Jun 1990 8:48:48 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Proposal Invitation-Integrated Manufacturing
Message-Id: <CMM.0.88.644255328.chandler@Sunburn.Stanford.EDU>
I have a Proposal Invitation (Deadline 6/15/90) - INTEGRATED MANUFACTURING
...
SIMA invites members in the School of Engineering or the Graduate School of
Business to submit propoisals seeking funds for new activities in integrated
manufacturing. The goal of this program is to broaden the group of Stanford
faculty members and students actively involved in research and education on
critical problems affecting the integration of design, automation, materials
processing, simulation and management within a manufacturing enterprise.
Please let me know if you are interested in receiving a copy of this
information.
Thanks much.
∂01-Jun-90 0947 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU New Logic/CS Journal
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 09:44:30 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05431; Fri, 1 Jun 90 09:30:05 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16576; Fri, 1 Jun 90 09:31:08 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06207; Fri, 1 Jun 90 09:27:55 -0700
Message-Id: <9006011627.AA06207@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0824; Fri, 01 Jun 90 11:24:26 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0807; Fri, 01 Jun 90 11:24:23 CDT
Date: Fri, 1 Jun 90 12:19:41 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
LICS@B.GP.CS.CMU.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: LICS%b.gp.cs.cmu.edu@VM1.NoDak.EDU
Subject: New Logic/CS Journal
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
CALL FOR PAPERS
METHODS OF LOGIC IN COMPUTER SCIENCE
An International Journal
Methods of Logic in Computer Science is a quarterly journal of computer
science and mathematics devoted to papers which employ the methods of
formal logic. Topics include but are not limited to: automated reasoning,
term rewriting, program semantics, program verification, complexity theory,
lambda calculus, logic programming, database theory, knowledge representation,
hardware specification, nonmonotonic logic, and the logic of programs.
Research contributions ranging from theoretical results to applications of the
above-mentioned areas are solicited.
Information for Authors
Submit 3 copies of each manuscript to either of the Co-editors or to any
Editor on the Editorial Board. Guidelines for Authors can be obtained from any
Editor or Ablex Publishing Corporation, 355 Chestnut St., Norwood, NJ 07648.
All papers will be refereed for accuracy and relevance.
Editorial Board
Mikhail Atallah, Purdue University
Val Breazu-Tannen, University of Pennsylvania
John Crossley, Monash University
E. Allen Emerson, University of Texas
Ronald Fagin, IBM-Almaden
Jean-Pierre Jouannaud, University of Paris
Daniel Leivant, Carnegie Mellon
Johann Makowsky, Israel Institute of Technology
Wiktor Marek, University of Kentucky
Kenneth McAloon, CUNY-Brooklyn
George Metakides, University of Patras
Anil Nerode, Cornell University
Ernst-Ruediger Olderog, Universitat Oldenburg
David Plaisted, University of North Carolina
Gerald Peterson, McDonnell-Douglas
Dana Scott, Carnegie Mellon
John C. Sheperdson, University of Bristol
Mark Stickel, SRI-International
David S. Warren, SUNY-Stony Brook
Co-Editors
Rick L. Smith
Department of Mathematics
University of Florida
Gainesville, FL 32611
Phone: (904)-392-6168
Email: rs@math.ufl.edu
Ralph W. Wilkerson
Department of Computer Science
University of Missouri-Rolla
Rolla, MO 65401
Phone: (314)-341-4653
Email: ralphw@cs.umr.edu
∂01-Jun-90 0948 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Tree Rotation Distance
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 09:45:42 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05435; Fri, 1 Jun 90 09:31:21 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16665; Fri, 1 Jun 90 09:32:23 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06334; Fri, 1 Jun 90 09:31:15 -0700
Message-Id: <9006011631.AA06334@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 0958; Fri, 01 Jun 90 11:26:22 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
0941; Fri, 01 Jun 90 11:25:08 CDT
Date: Fri, 1 Jun 90 12:20:09 -0400
Reply-To: Staffan Bonnier <stabo%ida.liu.se@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Staffan Bonnier <stabo%ida.liu.se@VM1.NoDak.EDU>
Subject: Re: Tree Rotation Distance
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In article <6331@crabcake> callahan@crabcake.cs.jhu.edu (Paul Callahan) writes:
>
>What is known about the problem of determining the minimum number
>of rotations required to transform one (rooted, oriented) binary tree
>into another? I attended a talk by Tarjan a couple years ago when
>I was at Penn State, and I seem to remember him saying that the
>existence of a polynomial time algorithm for this problem was an open
>question.
>
The following simple observation may be of some help to you:
A binary tree is full (a full binary tree is a tree in which every node
either has two children or is a leaf) iff it is (isomorphic to) the
parse tree of a term built from a number of constants and a binary
operator. For instance, the tree:
*
/ \
* c
/ \
d e
is the parse tree of ((d*e)*c). Moreover, a (left or right) rotation
in such a tree corresponds to one application of the associative law to
the term:
(A) x*(y*z) = (x*y)*z
A right-rotation of the tree in the example yields:
*
/ \
d *
/ \
e c
which corresponds to applying (A) from right to left, and thus obtaining
the term (d*(e*c)). Thus, the minimum number of rotations required to
transform one tree into another is the same as the minimum length of an
equational proof, proving that the corresponding terms are equal in the
theory (A).
Staffan Bonnier
∂01-Jun-90 0951 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Article of interest in this month's issue of CACM (!)
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 09:49:05 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05454; Fri, 1 Jun 90 09:34:42 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16743; Fri, 1 Jun 90 09:35:44 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06405; Fri, 1 Jun 90 09:34:44 -0700
Message-Id: <9006011634.AA06405@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1145; Fri, 01 Jun 90 11:30:25 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1129; Fri, 01 Jun 90 11:25:55 CDT
Date: Fri, 1 Jun 90 12:20:37 -0400
Reply-To: Bill Pugh <pugh%cs.umd.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Bill Pugh <pugh%cs.umd.edu@VM1.NoDak.EDU>
Subject: Article of interest in this month's issue of CACM (!)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
There is an article appearing this month (June) in CACM that should be of
interest to many theoretical computer scientists as well as practitioners. The
paper describes a new simple, efficient and practical alternative to balanced
trees. I've enclosed an overview of the paper below.
Part of the reason for posting this note is that a number people in
the theory community have noted that they routinely ignore CACM. Hopefully,
this can be changed if more good papers are submitted to CACM.
In addition to the paper in CACM, a number of follow-on papers have been
generated. Files associated with skip lists, such as overviews, postscript
versions of papers and source code libraries are available for anonymous
ftp from mimsy.cs.umd.edu (in the directory pub/skipLists).
Bill Pugh
Dept. of Computer Science
University of Maryland,
College Park MD 20742
pugh@cs.umd.edu
----------------------------------------------------------------------
CACM, June 1990, pages 668-676
Skip Lists: a Probabilistic Alternative to Balanced Trees
William Pugh,
Department of Computer Science
and Institute for Advanced Computer Studies,
University of Maryland, College Park
Overview
Skip lists are a data structure that can be used in place of balanced trees.
Skip lists use probabilistic balancing rather than strictly enforced balancing
and as a result the algorithms for insertion and deletion in skip lists are
much simpler and significantly faster than equivalent algorithms for balanced
trees (although only by constant factors).
Binary trees can be used for representing abstract data types such as
dictionaries and ordered lists. They work well when the elements are inserted
in a random order. Some sequences of operations, such as inserting the
elements in order, produce degenerate data structures that give very poor
performance. If it were possible to randomly permute the list of items to be
inserted, trees would work well with high probability for any input sequence.
In most cases queries must be answered on-line, so randomly permuting the input
is impractical. Balanced tree algorithms re-arrange the tree as operations
are performed to maintain certain balance conditions and assure good
performance.
Skip lists are a probabilistic alternative to balanced trees. Skip lists
are balanced by consulting a random number generator. Although skip lists have
bad worst-case performance, no input sequence consistently produces the worst-
case performance (much like quicksort when the pivot element is chosen
randomly). It is very unlikely a skip list data structure will be significantly
unbalanced (e.g., for a dictionary of more than 250 elements, the chance
that a search will take more than 3 times the expected time is less than
one in a million). Skip lists have balance properties similar to that of search
trees built by random insertions, yet do not require insertions to be random.
Balancing a data structure probabilistically is easier than explicitly
maintaining the balance. For many applications, skip lists are a more natural
representation than trees, also leading to simpler algorithms. The simplicity
of skip list algorithms makes them easier to implement and provides significant
constant factor speed improvements over balanced tree and self-adjusting
tree algorithms. Skip lists are also very space efficient. They can easily be
configured to require an average of 1 1/3 pointers per element (or even less)
and do not require balance or priority information to be stored with each node.
∂01-Jun-90 0950 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Request for bibilographic references: denotational semantics
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 09:47:45 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05444; Fri, 1 Jun 90 09:33:24 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16702; Fri, 1 Jun 90 09:34:26 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06378; Fri, 1 Jun 90 09:32:48 -0700
Message-Id: <9006011632.AA06378@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1043; Fri, 01 Jun 90 11:27:16 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1024; Fri, 01 Jun 90 11:25:29 CDT
Date: Fri, 1 Jun 90 12:20:20 -0400
Reply-To: Sid Kitchel <kitchel%iuvax.cs.indiana.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Sid Kitchel <kitchel%iuvax.cs.indiana.edu@VM1.NoDak.EDU>
Subject: Re: Request for bibilographic references: denotational semantics
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
steve@hubcap.clemson.edu ("Steve" Stevenson) writes:
> I'd like to get some bibliographic references to
>denotational semantics for OO languages.
For those of us who believe that messages are an integral part of
the object-oriented paradigm, Will Clinger's thesis is quite important:
William Douglas Clinger, _Foundations of Actor Semantics_,
MIT Ph.D. Dissertation, May 1981.
--Sid
--
Sid Kitchel...............WARNING: allergic to smileys and hearts....
Computer Science Dept. kitchel@iuvax.cs.indiana.edu
Indiana University kitchel@iubacs.BITNET
Bloomington, Indiana 47405-4101........................(812)855-9226
∂01-Jun-90 0955 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU dual graphs and co-automata
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 09:52:43 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05463; Fri, 1 Jun 90 09:38:17 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16851; Fri, 1 Jun 90 09:39:19 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06453; Fri, 1 Jun 90 09:36:34 -0700
Message-Id: <9006011636.AA06453@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1242; Fri, 01 Jun 90 11:30:38 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1213; Fri, 01 Jun 90 11:26:35 CDT
Date: Fri, 1 Jun 90 12:20:43 -0400
Reply-To: Marcel Schoppers <marcel%ads.com@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Marcel Schoppers <marcel%ads.com@VM1.NoDak.EDU>
Subject: dual graphs and co-automata
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
This problem might have been studied both under graph theory and under
automata theory:
To convert a graph or automaton into its dual you map edges/arcs of
the input structure into vertices/states of the dual structure, and
vertices/states of the input structure into edges/arcs of the dual.
The Question: If you know something about the input structure, what
do you know about the dual? Of particular interest is what you know
about the dual when the input structure is an automaton that accepts
a prefix-closed or suffix-closed language.
Can someone give me a reference on the properties of duals?
Marcel
∂01-Jun-90 0956 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Finding subsets of equations
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 09:53:43 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05465; Fri, 1 Jun 90 09:39:12 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA16906; Fri, 1 Jun 90 09:40:15 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06481; Fri, 1 Jun 90 09:39:26 -0700
Message-Id: <9006011639.AA06481@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1440; Fri, 01 Jun 90 11:30:54 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1428; Fri, 01 Jun 90 11:28:07 CDT
Date: Fri, 1 Jun 90 12:20:48 -0400
Reply-To: "Russell J. Abbott" <abbott%aerospace.aero.org@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Russell J. Abbott" <abbott%aerospace.aero.org@VM1.NoDak.EDU>
Subject: Finding subsets of equations
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Does anyone have or know of a solution to the following problem?
Suppose you have n equations in m unknowns, m > n and want to find a
subset of those equations in which the number of unknowns is no greater
than the number of equations. Is there a way to do that without a brute
force search through all possible combinations of equations with common
unknowns?
∂01-Jun-90 1017 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: SAT in _Computers & Intractability_
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 10:14:51 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05525; Fri, 1 Jun 90 10:00:28 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA18532; Fri, 1 Jun 90 10:01:30 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07274; Fri, 1 Jun 90 09:58:37 -0700
Message-Id: <9006011658.AA07274@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2713; Fri, 01 Jun 90 11:55:47 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2703; Fri, 01 Jun 90 11:55:43 CDT
Date: Fri, 1 Jun 90 12:20:54 -0400
Reply-To: "Stephen R. Tate" <srt%cs.duke.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Stephen R. Tate" <srt%cs.duke.edu@VM1.NoDak.EDU>
Subject: Re: SAT in _Computers & Intractability_
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Before I say (type) anything, let me say that it has been a while since
I read Garey and Johnson, so this is all by memory (and I don't have a copy
so I can't check easily).
In article <7341@ccncsu.ColoState.EDU>, ld231782@longs.LANCE.ColoState.EDU
(Lawrence Detweiler) writes:
> Their attention to the polynomial time requirement is confined to a paragraph
> on p. 44, where they claim that
>
> The polynomial boundedness of this computation will follow immediately
> once we show that Length(F(X)) is bounded above by a polynomial function
> of N...
>
> where N = Length(X). Quite to the contrary, this result does not follow
> "immediately". .... To the
> author's credit, they note that construction of the transformation
> "amounts to little more than filling in the blanks" in a formula...
This last part you mention is clearly the important statement. I think
it is a fair to make the assumption that the reader will think for him/herself.
Clearly, the problem of writing down the boolean formula is a simple
"fill in the blanks" problem, and as long as the output is not too large,
then it can be computed quickly (I'd even venture to guess that the time
is linear in the output size....). In fact, the conversion to the formula
is so simple it is even in logspace, not just polynomial time.
> Using the fundamental theorem of counting,
> and observing that the Q index ranges through P(N) (the variables R and V
> are constants, as noted in the text), H through P(N)↑2, and S the same,
> it can be stated instead that
>
> |U| < K1*P(N)↑5
>
> where K1 is some constant.
Now this is the real reason I posted... I can't believe you really said
this! Taking what you said above, the number of states is P(N)+P(N)↑2+P(N)↑2,
plus some constant stuff thrown in. Now why do you start adding exponents?
Clearly this sum is less than 3P(N)↑2 for even small values of N. In
other words, |U| < c*P(N)↑2 for some constant c. You go on to add
exponents again in your posting.... the basic rule is as follows,
if you are adding polynomials, the degree of the sum is the MAXIMUM of
the degrees of polynomials you are adding, NOT the sum of the degrees.
> I was most impressed with Garey and Johnson's development of SAT up to p. 44
> and am most chagrined with it afterwards. I look forward to learning of
> other's opinion on the matter in general and how appropriate my comments are
> in particular.
I don't remember thinking anything about it really.... of course I had
seen the same proof in about 3 other places and in about 4 classes before
I read it in Garey and Johnson....
Steve Tate ARPA: srt@duke.cs.duke.edu
UUCP: ..!decvax!duke!srt
∂01-Jun-90 1028 stager@Sunburn.Stanford.EDU Spring Quarter Grade Sheets
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 10:28:16 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA08776; Fri, 1 Jun 90 10:28:14 -0700
Date: Fri, 1 Jun 1990 10:28:13 PDT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Cc: sec@Sunburn.Stanford.EDU, instructor-sec@Sunburn.Stanford.EDU,
tas@Sunburn.Stanford.EDU, stager@Sunburn.Stanford.EDU
Subject: Spring Quarter Grade Sheets
Message-Id: <CMM.0.88.644261293.stager@Sunburn.Stanford.EDU>
Spring Quarter grade sheets have arrived, and will be sent out
today. Please note that there are separate sheets for graduating students.
Due dates are as follows:
Graduating students: Return as soon as possible, and no later than
NOON, THURSDAY, JUNE 14.
All other students: NO LATER THAN NOON, MONDAY, JUNE 18.
Grade sheets should be returned to Claire Stager in CSD Tresidder.
Drop the sheets in the CS-TAC box at MJH, or send via I.D. mail to
CSD Tresidder Rm. 101, Mail Code 3068.
***PLEASE DO NOT RETURN GRADE SHEETS DIRECTLY TO THE REGISTRAR'S OFFICE!***
Let me know if you have any questions.
Claire
∂01-Jun-90 1052 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU SAT in _Computers & Intractability_
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 10:50:23 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05662; Fri, 1 Jun 90 10:35:54 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA20850; Fri, 1 Jun 90 10:36:56 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09099; Fri, 1 Jun 90 10:35:58 -0700
Message-Id: <9006011735.AA09099@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2921; Fri, 01 Jun 90 11:57:16 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2904; Fri, 01 Jun 90 11:56:37 CDT
Date: Fri, 1 Jun 90 12:20:32 -0400
Reply-To: Lawrence Detweiler <ld231782%longs.lance.colostate.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Lawrence Detweiler <ld231782%longs.lance.colostate.edu@VM1.NoDak.EDU>
Subject: SAT in _Computers & Intractability_
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
a Guide to the Theory of NP Completeness_ contains a version of Cook's
satisfiability theorem for their "slightly nonstandard" NDTM model. For
this construction they show that (paraphrased)
1. There is a polynomial time algorithm that computes F(X), the function that
converts any particular NDTM problem to to an instance of SAT, and
2. That instance of SAT is satisfiable in all and only those cases of "input"
X for which the particular NDTM is accepting,
thus fulfilling the requirements of polynomial transformation (p. 34).
I respectfully submit that while their elaborate and "complicated" (but
necessarily so) demonstration of the second demand above leaves nothing
to be desired, their treatment of the first point is less rigorous,
perhaps even to the point of unacceptability and error.
Their attention to the polynomial time requirement is confined to a paragraph
on p. 44, where they claim that
The polynomial boundedness of this computation will follow immediately
once we show that Length(F(X)) is bounded above by a polynomial function
of N...
where N = Length(X). Quite to the contrary, this result does not follow
"immediately". For example, the solution to the _optimized_
Travelling Salesman problem is always bounded in size by a polynomial
function of the length of the input, but in no way can this be construed
to imply therefore the computation occurs in polynomial time! To the
author's credit, they note that construction of the transformation
"amounts to little more than filling in the blanks" in a formula, but it
seems some further words are in order to adequately convince the reader to
share their own confidence.
However, it is the close of this paragraph that supplies the most material
for confusion and perhaps even disbelief, where they state that
|U| = O(P(N)↑2)
and likewise for C. Or, to paraphrase, the cardinality (size) of the set of
all boolean variables in the SAT construction equals an order of growth of
P(N)↑2, where P(N) is the time bound on the algorithm (more specifically the
NDTM) being transformed.
From whence came this? The application of the syntax appears to be as
nonsensical as the cliche of comparison of apples and oranges: they are
relating a measure of the size of "input", in units of data, to the time
complexity of an algorithm, in units of time. That this is incongruous
is evident from an examination of other parts of the chapter, where they
carefully avoid this obscure comparison with rigorous separation of
description of the properties of complexity of data vs. of time, such as
at the close of the proof of Lemma 2.1 (p. 35).
Moreover, even if the literal interpretation of the statement is relaxed,
its vague meaning that the size of these SAT sets is somehow equivalent to
the square of the time bound on the algorithm under conversion is wholly
false.
Take |U|, the boolean variables in the SAT construction, enumerated in
Fig. 2.7 (p. 40). Since only the polynomial nature is at stake, only the
leading power of the range of all the variables Q (state), H (head), and S
(symbol) need be considered. Using the fundamental theorem of counting,
and observing that the Q index ranges through P(N) (the variables R and V
are constants, as noted in the text), H through P(N)↑2, and S the same,
it can be stated instead that
|U| < K1*P(N)↑5
where K1 is some constant.
|C|, the clauses in the final expression, is more complicated. Derived
mostly from Fig. 2.9 (p. 43), following is a list of the degree that each
clause group contributes:
G1: 1
G2: 2
G3: 2
G4: 1
G5: 0
G6: 2
---
8
so
|C| < K2*P(N)↑8
where K2 is some constant. Hence, using their function
Length[F(X)] = |U|*|C|
as a "reasonable" length of the conversion to the SAT problem, then
Length[F(X)] < K3*P(N)↑13
where K3 is some constant. If their argument about the relationship of
length and complexity holds here, this shows the conversion of the problem
to SAT can take place in polynomial time, satisfying the time requirement
for polynomial transformation.
Strangely, the authors give the exact number of clauses for many of the
groups in the text, possibly with the intention of using them later in
a similar manner as above, but no such reference can be found.
I was most impressed with Garey and Johnson's development of SAT up to p. 44
and am most chagrined with it afterwards. I look forward to learning of
other's opinion on the matter in general and how appropriate my comments are
in particular.
P.S.
- I would be interested in the correlation of any of this to Cook's original
version of the theorem. I assume he used a different model of NDTM and,
if so, time constraints would probably vary significantly (although still
polynomially).
- On p. 30, the authors write, "The reader may find it an interesting
exercise to verify the equivalence of our model to these ["more standard"
NDTM versions] with respect to polynomial time." To do so would require
showing that their NDTM version can "recognize a language" in polynomial
time IFF the other can. How close is this to being intuitively obvious?
This seems like too significant a point to relegate to a parenthetical
remark and delegation of derivation to the reader.
- Also, an NDTM is variously described as having a "splitting" property
wherein it can duplicate and fork into children, so to speak, whereas on
the other hand, it can "guess" the right answer. Are Garey and Johnson
responsible for this split in characterization, so that the latter arose
as a branch of the former from their nonstandard creation?
ld231782@longs.LANCE.ColoState.EDU
∂01-Jun-90 1224 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Shannon's Switching Game
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 12:22:25 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05844; Fri, 1 Jun 90 12:07:58 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04252; Fri, 1 Jun 90 12:09:01 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12845; Fri, 1 Jun 90 12:08:48 -0700
Message-Id: <9006011908.AA12845@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7476; Fri, 01 Jun 90 13:31:03 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7447; Fri, 01 Jun 90 13:31:01 CDT
Date: Fri, 1 Jun 90 14:27:49 -0400
Reply-To: "David G. Cantor" <dgc%math.ucla.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "David G. Cantor" <dgc%math.ucla.edu@VM1.NoDak.EDU>
Subject: Re: Shannon's Switching Game
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
simonson@uicbert.eecs.uic.edu In article <88200006@uicbert.eecs.uic.edu>
simonson@uicbert.eecs.uic.edu writes:
In Shannon's Swithching game, two players alternately choose
edges of a given undirected graph until all the edges are
chosen. There are two distinguished vertices in the graph, u
and v. The goal of one player is to connect these two vertices
and the goal of the other player is to separate them. It is
known that the "connecting" player can always win if there are
two edge disjoint spanning trees of the graph.
Does anyone know an algorithm for determining whether a given
undirected graph has two edge disjoint spanning trees? If this
result is well known, is it a special case of a larger theory?
and if such an algorithm exists, and one determines that a given
graph has two edge disjoint spanning trees, then is it easy to
find them?
------------------------------------------------------------------------
The answer to all of the questions is YES.
This is a result in matroid theory.
Some references are:
1. Alfred Lehman, "An Introduction to Matroid Theory", SIAM
J. 12 (1964), pp 687-725.
2. John Bruno and Louis Weinberg, "A Constructive Graph-Theoretic
Solution of the Shannon Switching Game", J. IEEE Trans. Circuit
Th. CT-17 (1970), pp 74-80.
3. W. J. Tutte, "Lectures on Matroids", J. of Research of the National
Bureau of Standards 69B (1973), pp 1-77.
Lehman was the original "solver" of this game. Unfortunately, none of
the above references is comprehensible. The standard texts on Matroid
Theory generally don't give the solution but refer the reader to one of
these three texts.
dgc
David G. Cantor
Department of Mathematics
University of California at Los Angeles
Internet: dgc@math.ucla.edu
∂01-Jun-90 1228 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU CACM
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 12:25:35 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA05850; Fri, 1 Jun 90 12:11:08 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA04447; Fri, 1 Jun 90 12:12:10 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA12848; Fri, 1 Jun 90 12:09:12 -0700
Message-Id: <9006011909.AA12848@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7583; Fri, 01 Jun 90 13:31:28 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7569; Fri, 01 Jun 90 13:31:26 CDT
Date: Fri, 1 Jun 90 14:27:59 -0400
Reply-To: Mike Langston <langston%cs.utk.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Mike Langston <langston%cs.utk.edu@VM1.NoDak.EDU>
Subject: CACM
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In a recent theorynet posting, Bill Pugh writes:
> Part of the reason for posting this note is that a number people in
> the theory community have noted that they routinely ignore CACM. Hopefully,
> this can be changed if more good papers are submitted to CACM.
I'm appending below a SIGACT News open letter (sans letterhead) that
addresses this point.
Mike Langston
CACM Associate Editor for Algorithms and Data Structures
--------------------------------------------------------------------------
LaTeX source follows
--------------------------------------------------------------------------
\documentstyle[12pt]{article}
\pagestyle{empty}
\setlength{\oddsidemargin}{0in}
\setlength{\topmargin}{0in}
\setlength{\textwidth}{6.4in}
\setlength{\textheight}{8.5in}
\begin{document}
\hspace{\fill}February 1, 1989
\par\vspace{30pt}\noindent
To: Readers of {\it SIGACT News}
\par\vspace{5pt}\noindent
From: Donna Brown, Mike Langston, David Shmoys and Jeff Vitter\\
\hspace*{37pt}Associate Editors for Algorithms and Data Structures
\par\vspace{5pt}\noindent
Subject: Theoretical Computer Science and {\it CACM}
\par\vspace{20pt}\noindent
{\it Communications of the ACM\/} has traditionally been a source of high
quality
theoretical results that are of interest to a broad spectrum of the computer
science community. Unfortunately, with the elimination of the Research
Contributions section, we have been experiencing a dwindling number of
acceptable submissions. We solicit your support in reversing this trend.
\par\vspace{10pt}\noindent
As you may know, there is now an Articles section in {\it CACM\/}, for which
submissions must meet the guidelines set out below.
\begin{quote}
Articles are papers written for the general ACM audience, who are persons with
four or more years experience in the computing field. Articles cover all
aspects of the computer science. They contain substantial tutorial material
that sets background, defines fundamental concepts, compares alternative
approaches, and explains the significance or application of the results.
They emphasize concepts and principles without excessive technical detail. They
make good use of figures. The {\it Scientific American\/} article is the model.
\end{quote}
While we do not wish to encourage submissions that are without significant
technical content, well-crafted submissions that meet the above criteria can,
we believe, be beneficial in several ways, including the following.
\begin{itemize}
\item Improve the usefulness of {\it CACM\/} to the algorithms/theory community.
How many recent papers have been of interest to you?
\item Increase the number of SIGACT members. An appalling number of our
colleagues are not members of ACM (and hence are not members of SIGACT). If
you ask why, one factor often mentioned is a perceived decline in the utility
of {\it CACM\/}.
\item Enhance the general appreciation of the role that theory plays and its
relevance to the remainder of the computing profession. If you discuss this
with a few of your nontheoretical contemporaries, you are likely to find plenty
of evidence that this is sorely needed.
\end{itemize}
We especially welcome papers written by senior researchers, who are in a good
position to give perspective and depth to Articles. Please feel free to
contact us for more information, or to discuss any preliminary ideas you may
have about the potential viability of a paper you might be willing to prepare.
\end{document}
∂01-Jun-90 1328 turner@sierra.Stanford.EDU Preliminary Time Schedule
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 13:28:51 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Fri, 1 Jun 90 13:24:59 PDT
Date: Fri, 1 Jun 90 13:24:59 PDT
From: turner@sierra.Stanford.EDU (Sherry A. Turner)
To: ee-faculty@sierra.Stanford.EDU
Cc: ee-adminlist@sierra.Stanford.EDU
Subject: Preliminary Time Schedule
Message-Id: <CMM.0.88.644271896.turner@>
The preliminary Time Schedule for Autumn Quarter 1990-91 is available for you
to pick up in McCullough 150. There will be several changes made to the
schedule which will come out sometime in late August or September.
Thanks,
Sherry
∂01-Jun-90 1442 chandler@Sunburn.Stanford.EDU Faculty Lunch
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 14:42:18 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA19816; Fri, 1 Jun 90 14:39:28 -0700
Date: Fri, 1 Jun 1990 14:39:26 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, bureaucrats@Sunburn.Stanford.EDU,
staff-rep@Sunburn.Stanford.EDU, stefik@xerox.com,
psz@sumex-aim.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Cc: chandler@Sunburn.Stanford.EDU, gibbons@sierra.Stanford.EDU,
kruger@sierra.Stanford.EDU
Subject: Faculty Lunch
Message-Id: <CMM.0.88.644276367.chandler@Sunburn.Stanford.EDU>
Our guest at next Tuesday's faculty lunch will be Professor Ken Kennedy of
Rice University (who will also be delivering the colloquium lecture at 4:15
that same day). Also attending will be Deans Gibbons and Kruger who will be
present to answer any questions you might have (about anything).
Please join us for this last faculty lunch of the quarter.
12:15 in MJH-146 (June 5).
See you there!
∂01-Jun-90 1507 chandler@Sunburn.Stanford.EDU Faculty Lunches
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 15:07:14 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA21195; Fri, 1 Jun 90 15:07:14 -0700
Date: Fri, 1 Jun 1990 15:07:13 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, bureaucrats@Sunburn.Stanford.EDU,
staff-rep@Sunburn.Stanford.EDU, stefik@xerox.com,
psz@sumex-aim.Stanford.EDU, rosenberg%hplsr@hplabs.hp.com
Cc: chandler@Sunburn.Stanford.EDU
Subject: Faculty Lunches
Message-Id: <CMM.0.88.644278033.chandler@Sunburn.Stanford.EDU>
Please note that contrary to original schedules sent out at the beginning of
the quarter, the last faculty lunch will be held next Tuesday, June 5.
∂01-Jun-90 1539 chandler@Sunburn.Stanford.EDU More Publications....
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 1 Jun 90 15:38:56 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA22990; Fri, 1 Jun 90 15:38:48 -0700
Date: Fri, 1 Jun 1990 15:38:47 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: More Publications....
Message-Id: <CMM.0.88.644279927.chandler@Sunburn.Stanford.EDU>
I have the following two publications. Let me know if you would like to
receive a copy.
1. NSF's Facutly Awards for Women Scientists and Engineers Program
Announcement and Guidelines (Applications must be postmarked no
later than September 1)
2. NSF's Alliances for Minority Participation (Program Solicitation
and Guidelines)...(Submission deadline for planning proposals is
7/17, submission deadline for implementation proposals is 1/31/91.
∂02-Jun-90 1152 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Levoy and van Glabbeek
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 2 Jun 90 11:51:57 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA01999; Sat, 2 Jun 90 11:52:24 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA08240; Sat, 2 Jun 90 11:49:29 PDT
Date: Sat, 2 Jun 90 11:49:29 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006021849.AA08240@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Levoy and van Glabbeek
I am very happy to be able to announce that Marc Levoy will
be joining us as an assistant professor in the fall. He will
have an office in CIS (I think) and will be setting up
a graphics laboratory. Marc will join CSL.
Also, Rob van Glabbeek will be visiting us next year as an
acting assistant professor. He will join the Theory Group.
-Nils
∂03-Jun-90 1347 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU committees for 90/91
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 3 Jun 90 13:47:31 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA10595; Sun, 3 Jun 90 13:47:58 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA08779; Sun, 3 Jun 90 13:44:57 PDT
Date: Sun, 3 Jun 90 13:44:57 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006032044.AA08779@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: committees for 90/91
I'm beginning to think about the 1990/91 CS Departmental Committees.
Here is your big chance to help Jeff Ullman and the Department next
year. Some people have already volunteered to take part in this
very important part of the Department's life. Please look over the
following list of committees and let me know which of them you would
like to serve on this year. Thanks, -Nils
Here is a description of the 1990 CS Departmental
Committees and people who have either already volunteered to
serve on them or are ex officio members:
PhD Program: Chair, Genesereth
Program, Policy, and Evaluation subsection. Evaluates
progress of PhD students and presides over Black Friday
proceedings. Arranges for advisers for PhD students.
Arranges CS 300 Autumn (and possibly Winter) Quarter research
seminar (where Department faculty and others describe their research
programs). Recommends PhD program policy.
Members: Genesereth (chair), Hemenway replacement, Roberts
Admissions subsection. Decides which students admitted to CSD
PhD program. Supervises PhD recruitment and welcoming.
Members: Genesereth (chair), Hemenway replacement
Comprehensive Exam: Designs, administers and grades the short tests
comprising the comprehensive exams. These will be given
in early October 1990. Overall chair: Mitchell
we need volunteers for the following exams:
Analysis of Algorithms Subsection:
Automata, Languages and Mathematical Theory of Computation
Subsection:
Artificial Intelligence Subsection:
Computer Architecture Subsection:
Software Systems Subsection:
Programming Languages Subsection:
Numerical Analysis and Databases Subsections:
Curriculum and Teaching: Decides about CSD courses. Recommends teaching load
policies. Members: Roberts
Facilities: Recommends plans and policies for CSD computer facilities.
Members: Wheaton, Dienstbier
MS Program: Decides which students admitted to MS program. Recommends
plans and policies for MS program. Advises MS students. Members:
Oliger (chair), Hemenway replacement, Roberts
(Since Joe Oliger will be on sabbatical during busy Winter Quarter, we
will need someone to take over the MS program during his absence.)
CSD Undergraduate Major: Recommends plans and policies for the major.
Arranges for advising students. Members: Roberts
Math/Comp. Sci. Major: Recommends plans and policies for the major.
Advises students. Members: Roberts
Computer Systems Engrg. Major: Recommends plans and policies for the
major. Advises students. Members: Roberts
Symbolic Systems Major: Recommends plans and policies for the major.
Advises students. Members: Roberts
Library and Publications: Recommends plans and policies for CSD
library and publication matters. Members: Tajnai, Wheaton
Fellowships: Recommends student fellowship disposition. Members:
Tajnai (chair), Hemenway replacement, Pollack, Bergman
Computer Forum: Recommends plans and policies for the CSD/CSL
industrial affiliates program. Members: Miller (chair), Pratt,
Tajnai, McCluskey, Wheaton
Colloquium: Organizes CSD colloquia---a series of prominent speakers
on computer science topics. Will meet on First Tuesday of every month at 4:15 pm.
Organizer: Golub
∂04-Jun-90 0544 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM cot in the act
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 4 Jun 90 05:44:12 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 520060; 4 Jun 90 08:42:57 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 125696; Mon 4-Jun-90 05:32:48 PDT
Date: Mon, 4 Jun 90 05:32 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: cot in the act
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900604123241.0.RWG@TSUNAMI.SPA.Symbolics.COM>
Reply-to: rwg@yukon.scrc.symbolics.com
(in case anybody asked me to stop sending these, and had their mail bounce).
By a process I think I can rigorize,
==== 2
\ 1 3 3 z
> (--------------- + -----------------) cot(-------- + f) =
/ 2 2 pi n + f
==== (pi n + f + z) (pi n + f - 3 z)
n>-inf
2 2
cot(f - 3 z) csc (f + z) + 3 csc (f - 3 z) cot(f + z)
Unfortunately, the seductive 1/ + 3/ in the summand does not correspond
to the 1* + 3* on the right. Nevertheless, this must be a cockeyed
glimpse of something very neat. George Gasper identified a distant
cousin as a discrete analog of a Bessel integeral. But this?
Maybe the partial fraction expansion of the cot provides a conventional
proof via the double sum.
Notice that for nonzero z, as f -> 0, the n=0 summand goes bananas
(essential singularity). Therefore the rest of the (unconditionally
convergent!) sum must do likewise to cool it out. This it achieves via
the cot growing almost linearly with n until close to cot(f) (which is
large), during which the series acts harmonic and tries to diverge.
Quiz: Choose, z = 2 sqrt(3) pi/13, and let f -> 9 pi/13, so
that the n = 0 summand -> finite*cot(pi). How does the rest of the
series prevent the blowup?
∂04-Jun-90 0926 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Finding subsets of equations
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jun 90 09:24:20 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA08716; Mon, 4 Jun 90 09:09:43 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA17147; Mon, 4 Jun 90 09:11:02 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA16727; Mon, 4 Jun 90 09:08:08 -0700
Message-Id: <9006041608.AA16727@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1986; Mon, 04 Jun 90 11:04:12 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1956; Mon, 04 Jun 90 11:04:09 CDT
Date: Mon, 4 Jun 90 12:00:06 -0400
Reply-To: tompa%geoduck.cs.washington.edu@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: tompa%geoduck.cs.washington.edu@VM1.NoDak.EDU
Subject: Re: Finding subsets of equations
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Russell J. Abbott asked the following:
Does anyone have or know of a solution to the following problem?
Suppose you have n equations in m unknowns, m > n and want to find a
subset of those equations in which the number of unknowns is no greater
than the number of equations. Is there a way to do that without a brute
force search through all possible combinations of equations with common
unknowns?
Here is a polynomial time algorithm for this problem, but I'd be interested
to know if there is a more efficient one. Construct a bipartite graph,
whose left block contains a vertex for each of the n equations, and whose
right block contains a vertex for each of the m unknowns. Now test if this
graph has a perfect matching. If it does not, then, by Hall's Theorem,
there is some set of k equations with at most k-1 unknowns among them, and
you are done. (The standard perfect matching algorithms can be made to
output the set of k equations when they fail to find a perfect matching.)
Now to finish, add a new vertex u to the left block, and invoke the
perfect matching algorithm m more times as follows: in the ith invocation,
u is adjacent only to the ith vertex in the right block. If any of these m
graphs fails to have a perfect matching, it must be because k equations
have exactly k unknowns among them, one of them being the one to which u is
currently adjacent (and again, the algorithm can be made to output the set
of k equations). If all m have perfect matchings, then every set of k
equations has at least k+1 unknowns among them, for all k.
This still seems like brute force to me: it would be interesting to know
whether the problem stated can be reduced to only one call on perfect
matching.
Martin Tompa
tompa@cs.washington.edu
∂04-Jun-90 1049 eisensee@sierra.Stanford.EDU Bob Noise
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jun 90 10:49:48 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Mon, 4 Jun 90 10:47:03 PDT
Date: Mon, 4 Jun 90 10:47:03 PDT
From: eisensee@sierra.Stanford.EDU (Sandra K. Eisensee)
To: ee-faculty@sierra, meng@mojave, cwf@rio
Cc: eisensee@sierra.Stanford.EDU
Subject: Bob Noise
Message-Id: <CMM.0.88.644521620.eisensee@>
I just received a phone call from Sematech that Bob Noise had died
of a heart attack this morning. The family would like all donations sent to
the American Institute of Learning, Austin, Texas.
∂04-Jun-90 1403 eisensee@sierra.Stanford.EDU Bob Noyes
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jun 90 14:03:03 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Mon, 4 Jun 90 14:00:29 PDT
Date: Mon, 4 Jun 90 14:00:29 PDT
From: eisensee@sierra.Stanford.EDU (Sandra K. Eisensee)
To: ee-faculty@sierra, meng@mojave, cwf@rio
Cc: eisensee@sierra.Stanford.EDU
Subject: Bob Noyes
Message-Id: <CMM.0.88.644533227.eisensee@>
The name is Noyes, not Noise. Sorry for the mistake.
∂04-Jun-90 1411 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Structures Registration Deadline
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jun 90 14:08:33 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA08893; Mon, 4 Jun 90 13:49:30 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA29911; Mon, 4 Jun 90 13:50:49 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19491; Mon, 4 Jun 90 13:48:12 -0700
Message-Id: <9006042048.AA19491@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3258; Mon, 04 Jun 90 15:45:15 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
3237; Mon, 04 Jun 90 15:45:11 CDT
Date: Mon, 4 Jun 90 16:43:21 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Steve Mahaney <srm@cs.arizona.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Steve Mahaney <srm%cs.arizona.edu@VM1.NoDak.EDU>
Subject: Structures Registration Deadline
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
The deadline for advance registration for the 5th IEEE
Structure in Complexity Theory Conference is near.
For an email program contact srm@cs.arizona.edu or
long@cis.ohio-state.edu
∂04-Jun-90 1449 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Finding subsets of equations
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jun 90 14:47:03 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA08929; Mon, 4 Jun 90 14:32:21 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA03373; Mon, 4 Jun 90 14:33:41 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21175; Mon, 4 Jun 90 14:33:33 -0700
Message-Id: <9006042133.AA21175@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 3741; Mon, 04 Jun 90 15:54:34 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
3716; Mon, 04 Jun 90 15:54:32 CDT
Date: Mon, 4 Jun 90 16:51:23 -0400
Reply-To: Bob Wilber <wilber%homxb.att.com@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Bob Wilber <wilber%homxb.att.com@VM1.NoDak.EDU>
Subject: Re: Finding subsets of equations
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Russell J. Abbott writes:
>Does anyone have or know of a solution to the following problem?
>Suppose you have n equations in m unknowns, m > n and want to find a
>subset of those equations in which the number of unknowns is no greater
>than the number of equations. Is there a way to do that without a brute
>force search through all possible combinations of equations with common
>unknowns?
Martin Tompa replies:
>Here is a polynomial time algorithm for this problem, but I'd be interested
>to know if there is a more efficient one. Construct a bipartite graph,
>whose left block contains a vertex for each of the n equations, and whose
>right block contains a vertex for each of the m unknowns. Now test if this
>graph has a perfect matching. If it does not, then, by Hall's Theorem,
>there is some set of k equations with at most k-1 unknowns among them, and
>you are done. (The standard perfect matching algorithms can be made to
>output the set of k equations when they fail to find a perfect matching.)
>
>Now to finish, add a new vertex u to the left block, and invoke the
>perfect matching algorithm m more times as follows: in the ith invocation,
>u is adjacent only to the ith vertex in the right block. If any of these m
>graphs fails to have a perfect matching, it must be because k equations
>have exactly k unknowns among them, one of them being the one to which u is
>currently adjacent (and again, the algorithm can be made to output the set
>nof k equations). If all m have perfect matchings, then every set of k
>equations has at least k+1 unknowns among them, for all k.
>
>This still seems like brute force to me: it would be interesting to know
>whether the problem stated can be reduced to only one call on perfect
>matching.
The answer is yes. Construct the bipartite graph G = (Q, V, E) where
Q = the set of equations, V = the set of variables, and E = { (q, v) |
equation q contains variable v }. Compute a maximal matching. As above,
if the number of edges in the matching is < n, then by Hall's Theorem
there is a subset of k equations with <= k-1 variables among them, and
we're done. Suppose we have a matching with n edges. Call a vertex v in V
exposed if it is not adjacent to any edge in the matching. Say that a path
is alternating if it is a simple path that starts at an exposed vertex
and alternates between unmatched and matched edges, with the first and last
edges being unmatched. (So the last vertex in the path is in Q.) Let Q'
be the set of vertices in Q that are contained in some alternating path.
Note that Q' can be computed in O(E) time by depth first search starting at
the exposed vertices.
If a subset S of k equations contains an equation in Q', then those equations
have at least k+1 variables among them. For there are the k variables at the
endpoints of the matched edges coming from the k equations, and in addition we
can find one more variable as follows. Let q_0 be an equation in S that is Q'.
Let q_0, v_0, q_1, v_1, ..., q_i, v_i be an alternating path from q_0 to an
exposed vertex v_i. Let q_j be the last equation in the path that is in S.
Vertex v_j is either the exposed vertex, v_i, or it is matched up with an
equation q_{j+1} that is not in S, and since v_j is in equation q_j it brings
the total number of variables among the equations in S up to k+1.
So if Q' = Q there is no subset of k equations with <= k variables.
Conversely, if Q'' = Q - Q' is nonempty, then Q'' has as many variables as
equations. For let V'' be the set of variables matched up with the variables
in Q'' (|V''| = |Q''|). Every variable in an equation in Q'' must be in V''.
Suppose to the contrary that an equation q_0 in Q'' has a variable v that is
not in V''. If v is exposed then edge (v, q_0) is an alternating path so q is
in Q', a contradiction. Otherwise let q_1 be the equation that v is matched
with. Since v is not in V'', q_1 is in Q'. But then the alternating path to
q_1 can be extended with edges (q_1, v) and (v, q_0), so q_0 is in Q', again a
contradiction.
The complexity of the algorithm is dominated by the time to compute one maximal
matching, O(|E| sqrt(m)).
Bob Wilber
∂04-Jun-90 1647 keyes@sierra.Stanford.EDU 1990 Outstanding Service Awards
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 4 Jun 90 16:47:47 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Mon, 4 Jun 90 16:46:28 PDT
Date: Mon, 4 Jun 90 16:46:28 PDT
From: keyes@sierra.Stanford.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.Stanford.EDU
Subject: 1990 Outstanding Service Awards
Message-Id: <CMM.0.88.644543187.keyes@>
The Selection Committee for the 1990 departmental Outstanding Service Awards
has reported their choices for this year's winners. I am pleased to announce
that the awards will be presented to:
Charlotte Coe
Kenneth E. Williams
Robert Helliwell
The awards will be officially presented at the departmental graduation exer-
cises on Sunday, June 17. Congratulations to the three winners, and thanks
for their dedicated service to the Department.
Joe Goodman
∂05-Jun-90 0317 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM cot in the act
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 5 Jun 90 03:16:56 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 520467; 5 Jun 90 06:14:47 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 125783; Tue 5-Jun-90 03:12:49 PDT
Date: Tue, 5 Jun 90 03:12 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: cot in the act
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900604123241.0.RWG@TSUNAMI.SPA.Symbolics.COM>
Message-ID: <19900605101241.3.RWG@TSUNAMI.SPA.Symbolics.COM>
Date: Mon, 4 Jun 90 05:32 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Reply-to: rwg@yukon.scrc.symbolics.com
(in case anybody asked me to stop sending these, and had their mail bounce).
By a process I think I can rigorize,
==== 2
\ 1 3 3 z
> (--------------- + -----------------) cot(-------- + f) =
/ 2 2 pi n + f
==== (pi n + f + z) (pi n + f - 3 z)
n>-inf
2 2
cot(f - 3 z) csc (f + z) + 3 csc (f - 3 z) cot(f + z)
[...]
Maybe the partial fraction expansion of the cot provides a conventional
proof via the double sum.
Well, it worked, but not conventionally! After 2.43 hrs, MACSYMA transformed
the Sum into - Sum - 2 RHS ! It is thus possible to manufacture more of
these by constructing double sums of rational functions that exhibit this
"reinkernation". Here, the double summand was
2 2 2 2
4 (pi n + f) (pi n + 2 pi f n + f + 3 a )
------------------------------------------------------------------------- =
2 2 2 2 2
(pi n + f - 3 a) (pi n + f + a) (pi k n + pi f n + pi f k + f + 3 a )
2 2 2 2
4 (pi k + f) (pi k + 2 pi f k + f + 3 a )
- -------------------------------------------------------------------------
2 2 2 2 2
(pi k + f - 3 a) (pi k + f + a) (pi k n + pi f n + pi f k + f + 3 a )
3 1
+ -------------------------------- + --------------------------------
2 2
(pi k + f - 3 a) (pi n + f + a) (pi k + f - 3 a) (pi n + f + a)
1 3
+ -------------------------------- + --------------------------------
2 2
(pi k + f + a) (pi n + f - 3 a) (pi k + f + a) (pi n + f - 3 a)
All this smacks of Weierstrass P functions, but I haven't figured a way to
get just one of the indices into the numerator, so that it winds up in the
denominator when I sum on the other index.
[...]
Quiz: Choose, z = 2 sqrt(3) pi/13, and let f -> 9 pi/13, so
that the n = 0 summand -> finite*cot(pi). How does the rest of the
series prevent the blowup?
The n=-1 term "contributes" a finite*cot(0) ! Each of the countable infinity of
the 0th term's poles near f = 0 must be neutralized by some other term. This is
a better explanation of how the sum manages to passivate that n=0 term.
∂05-Jun-90 0902 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU PODC'90
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 08:59:37 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA09913; Tue, 5 Jun 90 08:44:48 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01468; Tue, 5 Jun 90 08:46:09 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07555; Tue, 5 Jun 90 08:42:27 -0700
Message-Id: <9006051542.AA07555@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1575; Tue, 05 Jun 90 10:03:35 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1559; Tue, 05 Jun 90 10:03:31 CDT
Date: Tue, 5 Jun 90 10:56:56 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
levesque@iro.umontreal.ca
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: levesque%iro.umontreal.ca@VM1.NoDak.EDU
Subject: PODC'90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
9th ACM SIGACT-SIGOPS
Symposium on Principles of Distributed Computing
(PODC'90)
Organized by:
Conference Chair: Gregor v. Bochmann, Universite de Montreal
Program Chair: Cynthia Dwork, IBM Treasurer: Gilles Brassard, UdeM
Local Arr'nts: Pierre McKenzie, UdeM Reg. Chair: Lucie Levesque, UdeM
Sponsored by SIGACT and SIGOPS
With support from: ONR, BNR, DEC, MIT, NSERC, Universite de Montreal
PRELIMINARY PROGRAM
TUESDAY, August 21
Registration: 17:00 - 20:00, Reception: 18:00-21:00.
WEDNESDAY, August 22
Invited Lecture: 09:00 - 10:00
Barbara Liskov, MIT
Coffee break: 10:00 - 10:30
Session 1: 10:30 - 12:00 - Chair: Richard Ladner Atomic Snapshots
of Shared Memory, Yehuda Afek (Tel-Aviv University), Hagit Attiya (MIT),
Danny Dolev (IBM Almaden), Eli Gafni (Tel-Aviv University and UCLA),
Michael Merritt (AT & T Bell Laboratories) and Nir Shavit (Hebrew University).
Composite Registers, James Anderson (University of Texas at Austin).
The Inhibition Spectrum and the Achievement of Causal Consistency,
Carol Critchlow and Kim Taylor (Cornell University).
Lunch at the Hotel: 12:00 - 13:30
Session 2: 13:30 - 15:00 - Chair: Maurice Herlihy
Lazy Replication: Exploiting the Semantics of Distributed Services,
Rivka Ladin (DEC CRL), Barbara Liskov and Liuba Shrira (MIT).
Distributed Variable Server for Atomic Unification, Alon Kleinman,
Yoram Moses and Ehud Shapiro (The Weizmann).
Virtual Time II: Storage Management in Conservative and Optimistic
Systems, David Jefferson (UCLA).
Coffee break: 15:00 - 15:30
Session 3: 15:30 - 17:00 - Chair: Jim Burns
Self-Stabilizing Extensions for Message-Passing Systems, Shmuel Katz
(The Technion), Kenneth Perry (IBM Watson).
Self-Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity,
Shlomo Dolev, Amos Israeli and Shlomo Moran (The Technion).
Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual
Exclusion, Amos Israeli and Marc Jalfon (The Technion).
COCKTAILS AND BANQUET: 18:30 - 22:00
THURSDAY, August 23
Session 4: 09:00 - 10:30 - Chair: Nicola Santoro Continuous Clock
Amortization Need Not Affect the Precision of a Clock Synchronization
Algorithm, Frank Schmuck and Flaviu Cristian (IBM Almaden).
Distributed Control for PARIS, Baruch Awerbuch (MIT), Israel Cidon,
Inder Gopal, Marc Kaplan and Shay Kutten (IBM Watson).
Principles for High Speed Network Control: Congestion- and Deadlock-Freeness,
Self-Routing and a Single Buffer per Link, Yoram Ofek and Moti Yung
(IBM Watson).
Coffee break: 10:30 - 11:00
Session 5: 11:00 - 12:00 - Chair: Yehuda Afek
Cost-Sensitive Analysis of Communication Protocols, Baruch Awerbuch (MIT),
Alan Baratz (IBM Watson), David Peleg (The Weizmann).
A Quantitative Approach to Dynamic Networks, Baruch Awerbuch (MIT),
Oded Goldreich and Amir Herzbeg (The Technion).
Lunch (on your own): 12:00 - 14:00
Session 6: 14:00 - 16:00 - Chair: Krzysztof Apt
Tight Bounds for Weakly Bounded Protocols, Ewan Tempero and Richard Ladner
(University of Washington, Seattle).
Two Messages are Almost Optimal for Conveying Information, Alon Orlitsky
(AT & T Bell Laboratories).
A Decidable Temporal Logic to Reason About Many Processes, Allen Emerson
and Jai Srinivasan (University of Texas at Austin).
Reasoning about Probabilistic Algorithms, Josyula R. Rao (University
of Texas at Austin).
Coffee Break: 16:00 - 16:30
Session 7: 16:30 - 17:30 - Chair: Paris Kanellakis
Using Mappings to Prove Timing Properties, Nancy Lynch and Hagit Attiya (MIT).
Half-Order Modal Logic: How to Prove Real-Time Properties, Tom Henzinger
(Stanford University).
20:30 - 22:30: ACM - BUSINESS MEETING and RUMP SESSION
FRIDAY, August 24
Session 8: 09:00 - 10:30 - Chair: Benny Chor
Early-Delivery Atomic Broadcast, Ajei Gopal (Cornell University), Ray Strong
(IBM Almaden), Sam Toueg (Cornell University), Flaviu Cristian (IBM Almaden).
Agreement is Harder than Consensus: Set Consensus Problems in Totally
Asynchronous Systems, Soma Chaudhuri (University of Washington, Seattle).
Time- and Space-Efficient Randomized Consensus, James Aspnes
(Carnegie-Mellon University).
Coffee break: 10:30 - 11:00
Session 9: 11:00 - 12:30 - Chair: Anna Karlin
A Characterization of Eventual Byzantine Agreement, Joseph Halpern
(IBM Almaden), Yoram Moses (The Weizmann), Orli Waarts (Stanford).
Lower Bounds for Wait-Free Computation in Message-Passing Systems,
Maurice P. Herlihy and Mark R. Tuttle (DEC CRL).
Sharing Memory Robustly in Message-Passing Systems, Hagit Attiya (MIT),
Amotz Bar-Noy (IBM Watson), Danny Dolev (IBM Almaden).
LOCATION
Except for the Wednesday evening banquet, all events will be
held at the Hilton International Quebec, 3 Place Quebec, Quebec
city, (Quebec), Canada G1K 7M9.
The banquet will be held at Le Chateau Frontenac,
1 Rue des Carrieres, Quebec city, (Quebec), Canada G1R 4P5, less than a
kilometre away from the Hilton.
TRANSPORTATION
Air Canada has been designated the official carrier of PODC'90.
For travel within Canada, a 15% discount off the standard economy
fare is available with a 2-night minimum / 15-day maximum stay
requirement. For travel from the United States, a 25% discount is
available with no stay requirement and a 35% discount (subject to
availability) with a 2-night minimum / 15-day maximum stay
requirement. For the 15% or the 35% discount, reservations must
be made 7 days in advance. To obtain a convention discount, you
must call Air Canada 1-800-361-7585 and refer to file number:
90/874.
Distance from Quebec city Airport to the Hilton is less than 20
km. The Airport shuttle to downtown will cost 7$ CAN, and a taxi
18$ CAN. Quebec is about 3 hours driving from the International
Airports of Montreal.
CLIMATE
The temperatures in August range from the average daytime high
of 23!C to the average night-time low of 12!C. Rain showers are
possible with, say, 35% probability.
ATTRACTIONS
The hotel is located across from the Quebec Parliament, just
outside the fortifications surrounding the old city. Rich in history
and unique in North America, Old Quebec offers a piece of XVIIth
century Europe with its narrow streets, numerous cafes, artists
hang-outs, boutiques and fine restaurants, against a spectacular
background provided by the St-Lawrence river.
ADVANCE REGISTRATION
Please use a copy of this form to pre-register. Advance registration
closes July 31, 1990. Registration after July 31 is subject to a late
fee. Please mail your completed form with cheque (drawn on a
North American Bank) or money order (either in Canadian or US
funds) payable to ACM PODC'90 to:
ACM PODC'90
c/o Gregor v. Bochmann
Departement d'informatique et de recherche operationnelle
C.P. 6128, Station A, Universite de Montreal
Montreal, (Quebec), Canada, H3C 3J7
The regular registration fee includes a reception on Tuesday
evening, luncheon on Wednesday, the banquet on Wednesday
evening, coffee breaks, and a copy of the proceedings. The
student registration fee includes everything except the banquet.
Requests for refunds will be honoured until July 31, 1990. For
further information please contact Lucie Levesque by phone at
(514) 343-7535, fax (514) 343-2155, or send electronic mail to:
levesque@iro.umontreal.ca.
ACM - PODC'90 Registration Form
Family name ______________________________________________
Given name ______________________________________________
Affiliation ______________________________________________
Address ______________________________________________
______________________________________________
Postal code ____________________ Country ________________
Phone number ______________________________________________
e-mail ______________________________________________
Vegetarian ? ______________________________________________
Kosher (available for the banquet only) ? __________________
before July 31 after
CAN$ US$ CAN$ US$
ACM Member 255 225 340 300
Membership No. __________
Non-member 310 275 400 350
Student 85 75 170 150
Add'al banquet tickets 70 60 70 60
Total enclosed _____________CAN$ or US$ (please circle one)
HOTEL RESERVATION
A block of rooms has been reserved for the PODC'90 participants.
If you wish to reserve one of these rooms, please complete the
form below and return to:
ACM PODC'90
Hilton International Hotel
3, Place Quebec
Quebec city (Quebec)
Canada G1K 7M9
Hotel Hilton can be reached by phone (418) 647-2411, fax (418) 647-3737.
Please mention that you are part of the ACM PODC'90. Reservations must
be received by July 21, 1990. Accommodations should be confirmed with
a cheque for the first night deposit, or any major credit card.
The conference rate at Hotel Hilton is 115$CAN/single, 135$CAN/double
and 20$CAN/extra person, net of all eventual taxes. (Current exchange
rate is 1$CAN = 0.86$US). Check-in time is 16h00 and check-out time is
noon. For those participants wishing to arrive early or to stay on,
the conference rate will be honoured for extra days before or after the
conference.
ACM PODC'90 Hotel Reservation Form
Family name _______________________________________________
Given name _______________________________________________
Affiliation _______________________________________________
Address _______________________________________________
_______________________________________________
Postal code _______________________ Country _____________
Phone number _______________________________________________
Arrival date/time ___________________________________________
Departure date/time _________________________________________
Single or double _________________________________________
Deposit enclosed _________________ CAN _________________
or Credit card _________________________________________
Card No. _________________________________________
Expiry date _________________________________________
Signature _________________________________________
--
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+ Lucie Levesque +
+ Universite de Montreal, Dep. I.R.O. S-236, C.P. 6128, succursale A +
+ Montreal (Quebec) H3C 3J7, (514) 343-7535, levesque@iro.umontreal.ca +
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
∂05-Jun-90 0904 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Finding subsets of equations
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 09:02:25 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA09922; Tue, 5 Jun 90 08:47:35 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01629; Tue, 5 Jun 90 08:48:59 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07669; Tue, 5 Jun 90 08:46:14 -0700
Message-Id: <9006051546.AA07669@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1764; Tue, 05 Jun 90 10:05:20 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1750; Tue, 05 Jun 90 10:05:16 CDT
Date: Tue, 5 Jun 90 10:57:19 -0400
Reply-To: Martin Furer <furer%cs.psu.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Martin Furer <furer%cs.psu.edu@VM1.NoDak.EDU>
Subject: Re: Finding subsets of equations
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Russell J. Abbott has asked:
> Does anyone have or know of a solution to the following problem?
> Suppose you have n equations in m unknowns, m > n and want to find a
> subset of those equations in which the number of unknowns is no greater
> than the number of equations. Is there a way to do that without a brute
> force search through all possible combinations of equations with common
> unknowns?
Martin Tompa has answered with a polynomial time algorithm calling a maximum
bipartite matching subroutine m+1 times. He has remarked:
> This still seems like brute force to me: it would be interesting to know
> whether the problem stated can be reduced to only one call on perfect
> matching.
In fact Martin Tompa's implicit conjecture is correct, one call to a matching
algorithm is sufficient.
First, we follow Martin Tompa. We form the bipartite graph with equations on
the left and unknowns on the right hand side, and we compute a maximum
matching. If the maximum matching does not involve all equations (i.e., it
is not left-"perfect"), then the standard algorithm gives a subset of vertices
violating Hall's condition and solving the problem.
Now, let us look at the case, where every left vertex (equation) is matched.
We transform the bipartite graph into a directed graph as follows.
We direct all edges from left to right. In addition, the matched edges are
directed from right to left too. Using depth-first search, we compute the
strongly connected components of this directed graph. These components are
partially ordered by:
component(u) < component(v) iff there is a directed path from u to v.
Take any anti-chain (i.e., set of incomparable components) in this partial
order, and add all components which are greater (with respect to < ) than
any component in the anti-chain. We have a perfect matching on this subset,
and there is no edge to a right vertex (an unknown) outside. Hence, this is a
solution to the problem. In fact, it is not hard to see that every solution
is of this form (in the case, where a left-"perfect" matching exists).
Martin Furer
Pennsylvania State University
furer@shire.cs.psu.edu
∂05-Jun-90 0906 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Re: Finding subsets of equations
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 09:04:16 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA09933; Tue, 5 Jun 90 08:49:30 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01700; Tue, 5 Jun 90 08:50:53 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07921; Tue, 5 Jun 90 08:50:32 -0700
Message-Id: <9006051550.AA07921@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1844; Tue, 05 Jun 90 10:07:03 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1826; Tue, 05 Jun 90 10:05:38 CDT
Date: Tue, 5 Jun 90 10:57:13 -0400
Reply-To: gilbert%parc.xerox.com@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: gilbert%parc.xerox.com@VM1.NoDak.EDU
Subject: Re: Finding subsets of equations
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Russell J. Abbott asked the following:
> Does anyone have or know of a solution to the following problem?
> Suppose you have n equations in m unknowns, m > n and want to find a
> subset of those equations in which the number of unknowns is no greater
> than the number of equations. Is there a way to do that without a brute
> force search through all possible combinations of equations with common
> unknowns?
Martin Tompa gave a solution that calls maximum matching m times and asked:
> This still seems like brute force to me: it would be interesting to know
> whether the problem stated can be reduced to only one call on perfect
> matching.
It is indeed possible to solve the problem with one call on maximum
matching. This was essentially done by Dulmage, Mendelsohn, and
Johnson in the 1950's. It is now used in sparse matrix computation;
see e.g. Coleman, Gilbert, and Edenbrandt, "Predicting fill for sparse
orthogonal factorization", JACM 33 (1986) pp. 517-532.
Briefly, a matrix (or bipartite graph) with more rows than columns has the
"strong Hall property" (SHP) if every nonempty subset of columns is incident
on a strictly larger set of rows. Abbott's problem is to decide SHP for
the transpose of the matrix, and to find a certificate of non-SHPness if
one exists. Call the two sets of vertices in the bipartite graph of the
matrix "rows" and "columns".
Theorem: For a bipartite graph with more rows than columns,
the following are equivalent:
(1) M has SHP.
(2) There exists a maximum matching on M for which every vertex of M is
reachable from an unmatched row vertex by an alternating path.
(3) For every maximum matching on M, every vertex of M is reachable from
an unmatched row vertex by an alternating path. (I.e., any maximum
matching will do in (2).)
Thus one can test SHP in O(e sqrt(v)) time by finding any maximum matching
and then searching along alternating paths from unmatched rows. This also
gives a witness set if the matrix does not have SHP: In this case the set
C' of columns not reached during the search is incident only on the set R'
of rows matched to those columns, which cannot be larger.
(Incidentally, a square matrix M is usually defined to have SHP if every
proper subset of columns is incident on a strictly larger set of rows.
Then square M has SHP iff every pair of vertices is joined by an alternating
path in some/every maximum matching. Any bipartite graph has a canonical
"Dulmage-Mendelsohn decomposition" into subgraphs that are strong Hall or
whose transposes are strong Hall, which generalizes the strongly connected
components of a directed graph; the decomposition can be found by matching
plus depth-first search through alternating paths.)
- John Gilbert
gilbert@parc.xerox.com
∂05-Jun-90 0953 chandler@Sunburn.Stanford.EDU Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 09:52:59 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10136; Tue, 5 Jun 90 09:53:52 -0700
Date: Tue, 5 Jun 1990 9:53:52 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: tenured@cs.Stanford.EDU
Cc: chandler@Sunburn.Stanford.EDU
Subject: Faculty Meeting
Message-Id: <CMM.0.88.644604832.chandler@Sunburn.Stanford.EDU>
Don't forget today's tenured faculty meeting......2:30 in MJH-146 and don't
forget to come by my office and look at the letters received on Trefethen and
Petzold. Thanks much.
∂05-Jun-90 1041 axwang@Theory.Stanford.EDU This week's talk
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 10:39:38 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA10023; Tue, 5 Jun 90 09:42:13 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA03482; Tue, 5 Jun 90 09:41:41 -0700
Message-Id: <9006051641.AA03482@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: This week's talk
Date: Tue, 05 Jun 90 09:41:32 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
The speaker at AFLB this week will be Yatin Saraiya from Stanford.
AFLB will meet at its regular time and place: Thursday at 12:00pm in
MJH 252.
Subtree-elimination algorithms in deductive databases
Yatin Saraiya
A number of optimizations in deductive databases involve the
transformation of database logic programs to simpler, more efficiently
evaluable programs. In many cases, the desired transformation is a
simple syntactic restriction on the form of the original program, and
the correctness of the transformation indicates the existence of a
desirable property in the program. For example, the existence of {\it
basis-linearizability} in a nonlinear program indicates that the
program is inherently linear, and permits the use of special-purpose
query evaluators for linear recursions. Similarly, if a program is
{\it sequencable}, then it is conducive to a pipelined evaluation.
Further, the existence of $k$-{\it boundedness\/} in a program permits
the elimination of recursion overhead in evaluating the program. We
investigate the complexity of deciding whether such transformations
may correctly be applied to a given program.
Each of the problems that are mentioned above may be described in
terms of the {\it subtree-elimination problem}, which we define, and
for which we provide algorithms that are correct but not always
complete. Further, we show that the basis-linearizability and
sequencability problems are undecidable. Our construction yields
tight undecidability results for the detection of program equivalence.
In addition, we provide a decision procedure for the detection of
basis-linearizability in a restricted class of recursive programs.
Finally, we consider the tractability of simple cases of the
basis-linearizability, sequencability and $k$-boundedness problems, by
providing \script{NP}-hardness results and efficient algorithms for
various classes of each problem. Our investigation yields a complete
characterization of the complexity of testing the equivalence of
conjunctive queries, in terms of the polynomial heirarchy.
∂05-Jun-90 1119 cloutier@sierra.Stanford.EDU School of Engineering Faculty Meeting/BBQ
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 11:19:44 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 5 Jun 90 11:18:50 PDT
Date: Tue, 5 Jun 90 11:18:50 PDT
From: cloutier@sierra.Stanford.EDU (Mary Cloutier)
To: ee-faculty@sierra.Stanford.EDU
Cc: cloutier@sierra.Stanford.EDU
Subject: School of Engineering Faculty Meeting/BBQ
Message-Id: <CMM.0.88.644609929.cloutier@>
If you have not as yet responded to the invitation to the Faculty BBQ
and State of the School Message by Dr. Gibbons, I would appreciate
hearing from you within the next couple of days. I need to have a
final count for the BBQ. For those of you who might have forgotten
the details they are as follows:
BBQ in Terman Grove at 12:00 p.m. on Thursday, June l3th.
Followed by a Faculty Meeting in Tressider-Oak West
Dr. Gibbons will discuss "THE STATE OF THE SCHOOL: THE RECENT PAST
AND THOUGHTS FOR THE FUTURE."
Please respond to 3-3935 before the end of the day on Thursday, or
early Friday morning. Thank you for your cooperation.
Mary Cloutier
∂05-Jun-90 1316 cloutier@sierra.Stanford.EDU Wrong Day, Right Date
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 13:16:16 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 5 Jun 90 13:15:00 PDT
Date: Tue, 5 Jun 90 13:15:00 PDT
From: cloutier@sierra.Stanford.EDU (Mary Cloutier)
To: ee-faculty@sierra.Stanford.EDU
Cc: cloutier@sierra.Stanford.EDU
Subject: Wrong Day, Right Date
Message-Id: <CMM.0.88.644616899.cloutier@>
The BBQ is on WEDNESDAY, June 13th, not Thursday. Hope you all caught it.
Sorry!
Mary
∂05-Jun-90 1418 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU regularity conditions
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 14:15:36 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA10448; Tue, 5 Jun 90 14:00:58 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA22457; Tue, 5 Jun 90 14:02:21 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA18162; Tue, 5 Jun 90 14:00:34 -0700
Message-Id: <9006052100.AA18162@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 8030; Tue, 05 Jun 90 15:57:40 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
8015; Tue, 05 Jun 90 15:57:38 CDT
Date: Tue, 5 Jun 90 16:55:05 -0400
Reply-To: varricchio%pc346%astrom.hepnet@VM1.NoDak.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: varricchio%pc346%astrom.hepnet@VM1.NoDak.EDU
Subject: regularity conditions
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
It is well known that if a language L is accepted in linear time by a
deterministic one-tape Turing Machine then L is regular.(cf. Hennie F.
C. , One-tape off-line Turing Machine computations, Information and
Control, 1965,8:6, 553-578).
I wonder whether the same result holds for languages accepted in linear
time by a non-deterministic one-tape Turing Machine.
Stefano Varricchio
Dipartimento di Matematica
Universita dell`Aquila
67100 L`Aquila Italy.
∂05-Jun-90 1544 @RELAY.CS.NET:mazzetti@ed.aaai.org mazzetti annette taglio
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 5 Jun 90 15:44:01 PDT
Received: from relay2.cs.net by RELAY.CS.NET id ac13435; 5 Jun 90 18:44 EDT
Received: from [192.31.242.33] by RELAY.CS.NET id aa02499; 5 Jun 90 18:38 EDT
Received: from winston.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA00510; Tue, 5 Jun 90 15:20:29 PDT
Received: by winston.aaai.org (3.2/AAAI-SMI-3.2)
id AA04615; Tue, 5 Jun 90 15:20:38 PDT
Date: Tue, 5 Jun 90 15:20:38 PDT
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9006052220.AA04615@winston.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Grosz%pandora@HARVARD.HARVARD.EDU,
Hayes-Roth@SUMEX-AIM.STANFORD.EDU, Hinton@RI.CMU.EDU,
JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Lerman@Teknowledge.arpa, Nilsson@score.stanford.edu, RGSmith@SLCS.SLB.COM,
Rich@MCC.COM, ai.lenat@MCC.COM, bobrow@XEROX.COM,
buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM, conway@UM.CC.UMICH.EDU,
duda%polya@score.stanford.edu, duda@WARBUCKS.AI.SRI.COM,
engelmore@SUMEX-AIM.STANFORD.EDU, forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM,
hector%ai.toronto.edu@RELAY.CS.NET, hes@scrc-vallecito.arpa,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU, woods@HARVARD.HARVARD.EDU
Subject: mazzetti annette taglio
Cc: -@winston, Agenda@winston, Council@winston, Executive@winston,
Meeting@winston
Executive Council Meeting
Monday, July 31
Board Room, Room 300
Hynes Convention Center
9-5 pm
Agenda:
Introductions of the New Councilors
Standing Committee Reports
* Finances - Bugetary recommendations for each program/OH
* Conferences
* Symposium
* Workshops
* Publications
* Scholarships
* Fellows Program
Old Business
* CRB request
* Computer Museum request
* NRI and Mercury Project reports
* Details of Software Archival library project
New Business
* Results from Membership Survey
* IAAI and NCAI format
* AAAI's international links to other national organizations
* AAAI and the SAAI (Soviet association for AI)
(For those councilors retiring this year, you can join the meeting,
but it isn't necessary unless you are a standing committee chair.)
Please RSVP to me by June 15 if you are planning to attend the meeting.
Thanks, Claudia
PS A copy of this agenda and the membership survey results will be
mailed to you within the next 3 weeks.
∂05-Jun-90 1701 grossman@Sunburn.Stanford.EDU Party for Nils
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 5 Jun 90 17:01:18 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA23125; Tue, 5 Jun 90 16:31:35 -0700
Date: Tue, 5 Jun 90 16:31:35 -0700
Message-Id: <9006052331.AA23125@Sunburn.Stanford.EDU>
To: csdlist@Sunburn.Stanford.EDU
Subject: Party for Nils
From: Joyce Chandler <chandler@cs.Stanford.EDU>
Sender: grossman@Sunburn.Stanford.EDU
Don't forget to attend the going away bash for Nils Nilsson at 5:00pm today
(Tues, June 5) in the Psych courtyard (behind MJH).
∂06-Jun-90 0858 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU thanks
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Jun 90 08:58:03 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07551; Wed, 6 Jun 90 08:39:46 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA10543; Wed, 6 Jun 90 08:36:39 PDT
Date: Wed, 6 Jun 90 08:36:39 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006061536.AA10543@Tenaya.Stanford.EDU>
To: csd-list@cs.stanford.edu
Subject: thanks
Cc: nilsson@Tenaya.Stanford.EDU
Dear all:
It was wonderful basking in all of your good wishes
yesterday! Microphones rattle me (but keyboards
don't), so I didn't say yesterday what is most important
and that is that so many of you are the ones whose
hard work and commitment to computer science helped
make the last five years so productive. Thanks for
your efforts and support.
To the party organizers: what a classy event! More
fun than Gorbachev!
-Nils
∂06-Jun-90 0912 @RELAY.CS.NET:mazzetti@ed.aaai.org point of clarification
Received: from RELAY.CS.NET by SAIL.Stanford.EDU with TCP; 6 Jun 90 09:12:10 PDT
Received: from relay2.cs.net by RELAY.CS.NET id ab28234; 6 Jun 90 12:13 EDT
Received: from [192.31.242.33] by RELAY.CS.NET id aa14395; 6 Jun 90 12:09 EDT
Received: from winston.aaai.org by aaai.org (3.2/AAAI-SMI-3.2)
id AA01128; Wed, 6 Jun 90 08:45:09 PDT
Received: by winston.aaai.org (3.2/AAAI-SMI-3.2)
id AA05398; Wed, 6 Jun 90 08:45:25 PDT
Date: Wed, 6 Jun 90 08:45:25 PDT
From: Claudia Mazzetti <mazzetti@ed.aaai.org>
Message-Id: <9006061545.AA05398@winston.aaai.org>
To: Feigenbaum@SUMEX-AIM.STANFORD.EDU, Grosz%pandora@HARVARD.HARVARD.EDU,
Hayes-Roth@SUMEX-AIM.STANFORD.EDU, Hinton@RI.CMU.EDU,
JMC-LIsts@SAIL.STANFORD.EDU, Lehnert@cs.umass.edu,
Lerman@Teknowledge.arpa, Nilsson@score.stanford.edu, RGSmith@SLCS.SLB.COM,
Rich@MCC.COM, ai.lenat@MCC.COM, bobrow@XEROX.COM,
buchanan@VAX.CS.PITT.EDU, clancey.pa@XEROX.COM, conway@UM.CC.UMICH.EDU,
duda%polya@score.stanford.edu, duda@WARBUCKS.AI.SRI.COM,
engelmore@SUMEX-AIM.STANFORD.EDU, forbus@A.CS.UIUC.EDU, hart@KL.SRI.COM,
hector%ai.toronto.edu@RELAY.CS.NET, hes@scrc-vallecito.arpa,
hes@scrc-vallecito.symbolics.com, marty@cis.stanford.edu,
mckeown@CS.COLUMBIA.EDU, minsky@mc.lcs.mit.edu, reddy@FAS.RI.CMU.EDU,
swartout@VAXA.ISI.EDU, woods@HARVARD.HARVARD.EDU
Subject: point of clarification
Cc: mazzetti@winston
In my previous msg, I said the Council meeting would be held on
Monday, July 31. It should be Monday, July 30.
Claudia
∂06-Jun-90 1004 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM cot in the act II
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 6 Jun 90 10:04:12 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 520961; 6 Jun 90 12:19:17 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 125892; Wed 6-Jun-90 03:21:14 PDT
Date: Wed, 6 Jun 90 03:20 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: cot in the act II
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900605101241.3.RWG@TSUNAMI.SPA.Symbolics.COM>
Message-ID: <19900606102058.5.RWG@TSUNAMI.SPA.Symbolics.COM>
Date: Tue, 5 Jun 90 03:12 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
[...] It is thus possible to manufacture more of these by constructing
double sums of rational functions that exhibit this "reinkernation".
Here's the fundamental one:
(n pi + a) (n pi + b)
cot ---------------------
inf a + b
==== n pi + ----- 2 2
\ 2 (cot a) - (cot b)
> -------------------------- = ----------------- .
/ (n pi + a) (n pi + b) 2 (b - a)
====
n = - inf
This comes from Sum Sum 1/(L(k,n) (L(k,n)+L(n,k)), with
n k
L(k,n) := (k pi + a) (n pi + b).
To prove these, just expand the cot (after subtracting n pi from its
argument) and notice that Sum summand(k,n)+summand(n,k) (= twice the
double sum) degenerates. This is beginning to look simple enough to be
old stuff. Any recollections out there?
All this smacks of Weierstrass P functions, but I haven't figured a way
just L(k,n) := (w1 k + w2 n + z)↑2 . Without the ↑2, we might get an
interesting formula for 0.
By the way, Whittaker and Watson give the double sum for P, and remark that
its convergence is computationally hopeless. Then on the very next line,
they do the inner sum, leaving a single sum of csc↑2. Because the
coefficient of the summation index is nonreal, this is a very decent
(~ geometric) converger, and you can get the consecutive cscs out of a
highly stable 2nd order recurrence. (But theta fcns will win out in the
long run.)
∂06-Jun-90 1454 ingrid@russell.Stanford.EDU CSLI Calendar, 7 June, vol. 5:31
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Jun 90 14:54:30 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA21234; Wed, 6 Jun 90 14:29:35 PDT
Date: Wed, 6 Jun 90 14:29:35 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9006062129.AA21234@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: CSLI Calendar, 7 June, vol. 5:31
C S L I C A L E N D A R O F P U B L I C E V E N T S
-----------------------------------------------------------------------------
7 June 1990 Stanford Vol. 5, No. 31
_____________________________________________________________________________
A weekly publication of the Center for the Study of Language and
Information (CSLI), Ventura Hall, Stanford University, Stanford, CA 94305-4115
____________
CSLI ACTIVITIES FOR THIS THURSDAY, 7 JUNE 1990
12:00 noon TINLunch
Cordura 100 Computers and Musical Structure
Jonathan F. Hallstrom
Department of Music
Colby College
(visiting CCRMA)
(colby!jfhallst@uunet.uu.net)
Abstract below
Abstract in last week's Calendar
2:15 p.m. CSLI Seminar
Cordura 100 Controversies in Natural-Language Research 8
led by Stanley Peters
(peters@csli.stanford.edu)
Title: Possible Worlds Semantics and Situation
Semantics
Stanley Peters
Abstract in last week's Calendar
____________
ANNOUNCEMENT
This is the last Calendar of the academic year. We will resume
publication in late September.
____________
POETICS WORKSHOP
Unstressed Syllables in the Rhythmic Patterns of
Contemporary Russian Verse
Vycheslav Ivanov
Moscow University
Thusday, 7 June, 4:00 p.m.
Ventura 17
No abstract available. This workshop has been postponed to this new
date.
____________
PHILOSOPHY DEPARTMENT COLLOQUIUM
Internal Social Criticism:
A Look at Wittgenstein and Rawls
Mark Cladis
Department of Religious Studies
Stanford University
Friday, 8 June, 3:15 p.m.
Building 90, Room 91A
No abstract available.
____________
APHASIA PROJECT MEETING
The Cerebral Organization of Word Meaning
Tatyana Glezerman
Tuesday, 12 June, 2:30 p.m.
Cordura 100
I will discuss a new model of the cerebral organization of word
meaning. This model is based on taking into consideration three
factors of brain cortex differentiation:
(1) "vertical"-symbolic language and gnostic-praxic functional levels;
(2) the "horizontal"-system "interior-posterior brain";
(3) the functional asymmetry-system "left-right brain."
We distinguish two companions of word meaning. The first companion is
connected with visual gnoses while the second one is connected with
categorical thinking. The hemispheric symbolic associations related
to the word will also be considered.
I will give examples used with aphasia patents, as well as examples
from the historical language development.
This will be the last aphasia project meeting of the academic year,
and it is open to the public.
____________
∂06-Jun-90 1644 bergman@Sunburn.Stanford.EDU excerpt from Campus Report Column, June 6, 1990
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Jun 90 16:44:47 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA29145; Wed, 6 Jun 90 16:44:58 -0700
Date: Wed, 6 Jun 1990 16:44:56 PDT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: excerpt from Campus Report Column, June 6, 1990
Message-Id: <CMM.0.88.644715896.bergman@Sunburn.Stanford.EDU>
Subject: SPO Campus Report Column, June 6, 1990
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
Defense Advanced Research Projects Agency (DARPA) Broad Agency
Announcement: Advanced Computing Systems: Knowledge-Based Systems
Technology
Proposals are sought that investigate innovative ideas about methods
to create very large knowledge bases, integrate knowledge-based
systems with heterogeneous software systems, extend and integrate
approaches to automated reasoning, and facilitate the automated
acquisition of knowledge. Additionally, proposals are also sought
that will design and construct measures of evaluation and test
knowledge bases and knowledge-based applications in domains such as
design/diagnosis, natural language, planning, and/or image
understanding for use by a wide range of researchers. Proposals can
range from small-scale efforts that are primarily theoretical in
nature, to medium-scale experimental and prototyping efforts of
hardware and/or software, to larger-scale integrated systems efforts
which include industrial cooperation and cost sharing.
Collaborative efforts and teaming are encouraged. Deadline: Sept.
11, 1990.
National Science Foundation Policy Analysis
To provide support for development and application of analytical
methods for science and technology policy analysis. Support in the
selection, development, and application of quantitative science and
technology policy analysis methods including the collection,
retrieval and analysis of demographic, economic, and academic data.
No posted deadline.
∂06-Jun-90 1649 bergman@Sunburn.Stanford.EDU excerpt from SPO Campus Report Column, May 31, 1990
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 6 Jun 90 16:49:09 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA29112; Wed, 6 Jun 90 16:44:13 -0700
Date: Wed, 6 Jun 1990 16:44:12 PDT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: excerpt from SPO Campus Report Column, May 31, 1990
Message-Id: <CMM.0.88.644715852.bergman@Sunburn.Stanford.EDU>
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
Office of Naval Research Guide To Programs 1989
The revised ONR Guide to Programs contains specific information
about ONR programs and research priorities to aid investigators in
preparing and submitting research proposals. Available in SPO.
1991-92 Fulbright Scholar Program
Information is available for a number of Fulbright programs:
1) Research and Lecturing in Middle East, North Africa, South Asia
Deadline: June 15 for India -- Aug. 1 for all other locations.
2) Fulbright Lecturing Awards to Panama in Business Administration
and Economics, Journalism, Law, Political Science, Ethics, Public
Administration. 3) Western European Regional Research Awards for
research on European politics, society, and culture, past and
present. 4) Lecturing and Research Opportunities in Eastern Europe.
Deadline: Aug. 1, 1990.
National Science Foundation Faculty Awards for Women Scientists and
Engineers
To recognize the nation's most outstanding and promising women
scientists and engineers in academic careers of research and
teaching, and to retain these women scientists and engineers in
academia and to facilitate the further development of their careers.
The NSF expects to make 100 awards under this competition. Support
will consist of an annual grant of $50,000 per year for up to five
years to be used to support the research activities of the awardee.
Applicants must be nominated by their institution. Deadline: Sept.
1, 1990.
NSF Young Scholars Projects
NSF will support summer programs for high school students exploring
careers in science, engineering, and mathematics. There are two
programs available, one aimed at 8th to 12th graders, and another
for 7th to 9th graders who are minorities, handicapped, or
economically disadvantaged. A total of $7 million is available for
grants ranging from $8,000 to $100,000. Deadline: Aug. 6, 1990.
∂07-Jun-90 0336 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM B Cohen
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 7 Jun 90 03:36:08 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 521584; 7 Jun 90 06:37:00 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 125999; Thu 7-Jun-90 03:35:15 PDT
Date: Thu, 7 Jun 90 03:35 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: B Cohen
To: "hpm@rover.ri.cmu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
cc: "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900607103503.0.RWG@TSUNAMI.SPA.Symbolics.COM>
Thanks for posting that--I was getting itchy. Didn't Cohen
also offer to eat as much Pu as Nader would eat caffeine, and
snort as much as Nader would snort nicotine? (According to
Forbes, the "ecologists" are so upset over ozone and greenhouse
that some are daring to reconsider nukes.)
∂07-Jun-90 1358 chandler@Sunburn.Stanford.EDU General Faculty Meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 7 Jun 90 13:58:32 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA21627; Thu, 7 Jun 90 13:58:30 -0700
Date: Thu, 7 Jun 1990 13:58:29 PDT
From: "R. Joyce Chandler" <chandler@Sunburn.Stanford.EDU>
To: faculty@cs.Stanford.EDU
Cc: pollock@cs.Stanford.EDU, chandler@Sunburn.Stanford.EDU
Subject: General Faculty Meeting
Message-Id: <CMM.0.88.644792309.chandler@Sunburn.Stanford.EDU>
Just to remind you that there will be a general faculty meeting next Tuesday,
June 12 at 2:30 in MJH-146 to approve degree candidates. If you have any
agenda items please let me know. Thanks much.
∂08-Jun-90 1321 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU faculty meeting
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jun 90 13:21:02 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15194; Fri, 8 Jun 90 13:22:04 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA12263; Fri, 8 Jun 90 13:18:51 PDT
Date: Fri, 8 Jun 90 13:18:51 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006082018.AA12263@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: faculty meeting
As Joyce announced earlier, we will be having a
faculty meeting on Tuesday, June 12 at 2:30 p.m.
in mjh 146. Besides the formal matters of approving
degree candidates, Jeff and I think it would be useful
to have some discussion about how best to use
our empty billets during the next year or two (or three).
This discussion will be helpful to us in preparing to
write the Deans about requests to initiate and
continue searches.
Assuming that we make the Petzvold and Trefethen
appointments, we have the following billets
potentially available for next year:
programming languages billet (again!)
Eppinger replacement
billet "6.6" (one of the billets Jim Gibbons was promised
by the Provost when he became Dean)
-Nils
∂08-Jun-90 1329 @Sunburn.Stanford.EDU:gio@earth.stanford.edu Engineer's degree in CS progress report and proposal
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jun 90 13:28:55 PDT
Received: from Earth.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA15401; Fri, 8 Jun 90 13:28:56 -0700
Received: by earth.stanford.edu (4.0/inc-1.0)
id AA04211; Fri, 8 Jun 90 13:30:09 PDT
Date: Fri, 8 Jun 1990 13:30:08 PDT
From: Gio Wiederhold <gio@earth.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: Engineer's degree in CS progress report and proposal
Message-Id: <CMM.0.88.644877008.gio@earth.stanford.edu>
CSDers:
A small update in regard to the proposed CSD Engineers Program.
I omit from this note the background information. I'll gladly mail
it to anyone who expresses an interest.
1. I had a meeting with Dean Kruger.
a. The School of Engineering supports having an Engineers Program as a
recognized and valuable option. To deal with the name (un)recognition
problem there is a formal proposal, now blessed by most of the chairman of
departments that issue such degrees, to change it the degree to
'Advanced Engineer'. That change is likely to happen.
b. The school would welcome a proposal for an engineer's degree in CSD,
it should follow the rules now set up for School of Engineering degrees.
2. A nuber of discussion followed the lunch presentation earlier this year.
A number of faculty expressed desire for a formal program beyond the MS.
Jeff Ullman (primarily) questions the cost-benefit of the Engineers
degree --- to much work (i.e., units requirements for the benefit gained)
A lower demand degree could be something like an MS (Honors), proposed
by Ed Feigenbaum. Roy Jones suggested that such a program might be 72
units. Such a degree would also require School of Engineering approval.
A modified Master's degree would not include a formal thesis to be filed
with the University.
The following residence times accrue under various cases:
Advanced
Current Old KSL Honors Engineers Engineers
CS MS MS AI MS per Univ. per SOE
Support Mode
units 45 54 72? MS+36=81 90
---- ---- ---- ---- ----
units/quarter
All self supported 12 4 not 6 7 8
or external support 13 4 avail- 6 7 7
14 4 able in 6 6 7
15! 3 program 5 6 6
Fully TA/RA supported 9 5 6 8 9 10
(9 unit limitation)
First 9 months self sup. 12, 4 not av. 7 8 9
RA support during 9
degree research
----- quarters at Stanford -----
For students continuing in the summer the residency would have to be
about 2.5 years, versus 1.25 years for MS students, equally supported.
3. While I agree with Jeff that the cost benefit of the Advanced Engineers
degree is not as good as for the CS Master's degree, I would still
like to propose that we offer such a degree, matching thge School of
Engineering requirements. It would be handled by the MS committee,
and admission subject to the restrictions proposed earlier, principally
a. Completion of the CS Master's requirements
b. Comittment of a faculty adviser to supervise the thesis.
c. A possible restriction of the number of admittees per year, say 10.
I regret that I will be out of town during the next faculty, I would
welcome a discussion.
Gio Wiederhold
∂08-Jun-90 1529 @Sunburn.Stanford.EDU:J.J1066@Macbeth.Stanford.EDU Re: committees for 90/91
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jun 90 15:29:28 PDT
Received: from Macbeth.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19849; Fri, 8 Jun 90 15:29:44 -0700
Date: Fri 8 Jun 90 15:30:25-PDT
From: joe Hastings <J.J1066@Macbeth.Stanford.EDU>
Subject: Re: committees for 90/91
To: nilsson@tenaya.Stanford.EDU
Cc: faculty@cs.stanford.edu, J.J1066@Macbeth.Stanford.EDU
In-Reply-To: <9006032044.AA08779@Tenaya.Stanford.EDU>
Message-Id: <12596265037.32.J.J1066@Macbeth.Stanford.EDU>
Omar,
Joe here. Got your message. Will pass the two people who
you wrote of. If the other person needs the nit(unit that is),
let me know. Thanks.
Joe
p.s. I'm still liooking for someone to teach the course this summer,
so if you happen to know of anyone who wants to earn a leittle extra
money for a small weekly time commitment, let me know. Thanks.
-------
∂08-Jun-90 2229 @Sunburn.Stanford.EDU,@coraki.stanford.edu:pratt@cs.stanford.edu yet another copy, just in case
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 8 Jun 90 22:29:49 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA26199; Fri, 8 Jun 90 22:29:16 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA16098; Fri, 8 Jun 90 22:29:14 PDT
Message-Id: <9006090529.AA16098@coraki.stanford.edu>
To: logic@cs.stanford.edu
Reply-To: LICS@b.gp.cs.cmu.edu
Subject: yet another copy, just in case
Date: 08 Jun 90 22:29:13 PDT (Fri)
From: pratt@cs.Stanford.EDU
------- Forwarded Message
Date: Fri, 8 Jun 90 20:05:15 EDT
Subject: LICS: please respond
From: LICS@b.gp.cs.cmu.edu
Date: Fri, 8 Jun 90 17:31:40 EDT
MAILING LIST FOR LOGIC IN COMPUTER SCIENCE
As of Fall 1990 only people on a new LICS database will receive
directly announcements about the IEEE Logic in Computer Science
Conferences.
If you are interested in receiving such information,
please fill out the form below and return it by email
(or physical mail), by July 8 if possible.
If you are NOT INTERESTED, please tell us by return email,
so as to spare us the cost of approaching you by physical mail
after that date.
PLEASE FORWARD this message to potentially interested persons
who you suspect might not be on our present mailing list.
We apologize for multiple copies of this message.
Thank you.
lics@cs.cmu.edu
Logic in Computer Science
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
===================================
NAME (first, middle initial, last):
POSTAL ADDRESS:
EMAIL ADDRESS(ES):
*******
Would you be satisfied with receiving LICS CALLS FOR PAPERS
(and similar announcements) via EMAIL ONLY? (yes/no)
Would you be satisfied with receiving FINAL PROGRAMS and
REGISTRATION FORMS via email only? (yes/no)
[Note: you will need to print registration forms and send
them along with a check by PHYSICAL mail].
*******
Optional information (might be used in relation to paper submittals):
- --------------------
PHONE:
FAX/TELEX:
------- End of Forwarded Message
∂11-Jun-90 0328 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM cot(1/(n pi))
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 11 Jun 90 03:28:53 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 522805; 11 Jun 90 06:26:43 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 126374; Mon 11-Jun-90 03:24:42 PDT
Date: Mon, 11 Jun 90 03:24 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: cot(1/(n pi))
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
In-Reply-To: <19900606102058.5.RWG@TSUNAMI.SPA.Symbolics.COM>
Message-ID: <19900611102439.5.RWG@TSUNAMI.SPA.Symbolics.COM>
Date: Wed, 6 Jun 90 03:20 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
[...] Here's the fundamental one:
(n pi + a) (n pi + b)
cot ---------------------
inf a + b
==== n pi + ----- 2 2
\ 2 (cot a) - (cot b)
> -------------------------- = ----------------- .
/ (n pi + a) (n pi + b) 2 (b - a)
====
n = - inf
A peculiar, unilateral limiting case:
2
inf a
==== 2 2 n pi cot(----)
\ 1 2 a 1 2 n pi
> -- + csc (----) (------ - -----------) + ---------------
/ 4 n pi 2 2 2 2 2 2 2 2 2
==== a n pi n pi - a (n pi - a )
n = 1
2
cot(a) csc (a) 1
= -------------- - ----
2 a 4
2 a
If you believe this, solve for the cot(a) on the right for a trivial
proof-from-hell that cot is an odd function.
∂11-Jun-90 1214 axwang@Theory.Stanford.EDU
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 12:12:52 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA17301; Mon, 11 Jun 90 11:14:37 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA11664; Mon, 11 Jun 90 11:14:09 -0700
Message-Id: <9006111814.AA11664@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject:
Date: Mon, 11 Jun 90 11:14:07 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
The speaker at AFLB this week will be Naoki Abe from UC Santa Cruz.
AFLB meets at its usual time and place: 12:00pm, Thursday, MJH 252.
On the Computational Complexity of Approximating
Distributions by Probabilistic Automata
Naoki Abe
Manfred K. Warmuth
Department of Computer Science
UC Santa Cruz, CA 95064
We address the question of approximating an arbitrary, unknown source
distribution by distributions generated by probabilistic automata.
Probabilistic automata (PA's), and hidden Markov models (HMM's) which
are closely related to PA's, are used extensively as models for
probabilistic generation of speech signals for the purpose of speech
recognition. We investigate a hitherto neglected aspect of this
important, well-studied problem: Does there exist an {\em efficient}
training algorithm such that the trained PA's {\em provably converge}
to a model close to the optimal one with high confidence, after only a
feasibly small set of training data? We model this problem in the
framework of computational learning theory and analyze the sample as
well as computational complexity. We show that the number of examples
required for training PA's is moderate -- essentially linear in the
number of transition probabilities to be trained and a low-degree
polynomial in the example length and parameters quantifying the
accuracy and confidence. Computationally, however, training PA's is
quite demanding: Fixed state size PA's are trainable in time
polynomial in the accuracy and confidence parameters and input length,
but {\em not} in the alphabet size, unless $RP = NP$. The latter
result is shown via a strong non-approximability result for the single
string training problem for 2-state PA's, which is of independent
interest.
∂11-Jun-90 1215 axwang@Theory.Stanford.EDU AA Qual solutions
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 12:13:52 PDT
Received: from Baal.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA17306; Mon, 11 Jun 90 11:16:02 -0700
Received: from LOCALHOST by Baal.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA11675; Mon, 11 Jun 90 11:15:29 -0700
Message-Id: <9006111815.AA11675@Baal.Stanford.EDU>
To: aflb-all@Theory.Stanford.EDU
Subject: AA Qual solutions
Date: Mon, 11 Jun 90 11:15:28 -0700
From: Alexander Wang <axwang@Theory.Stanford.EDU>
On Thursday, there will be a special AFLB at which the solutions to
this year's AA qual will be presented. This session will begin in
MJH 252 at 1:00pm after the regularly scheduled AFLB talk.
∂11-Jun-90 1222 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU ACM
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 12:20:08 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA17375; Mon, 11 Jun 90 12:04:55 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01282; Mon, 11 Jun 90 12:06:51 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24682; Mon, 11 Jun 90 12:06:36 -0700
Message-Id: <9006111906.AA24682@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1983; Mon, 11 Jun 90 13:33:49 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1965; Mon, 11 Jun 90 13:32:46 CDT
Date: Mon, 11 Jun 90 14:22:33 -0400
Reply-To: "Wm. Randolph Franklin" <wrf%ecse.rpi.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: "Wm. Randolph Franklin" <wrf%ecse.rpi.edu@VM1.NoDak.EDU>
Subject: ACM
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
In Don Gillies <gillies@p.cs.uiuc.edu>'s message of Wed, 23 May 90
14:21:11 -0400, Subject: Re: ACM Election, The Sequel, he writes:
>
> interest paper. In particular, the following places did not exist
> IEEE "leecho" magazines (Computer, Software, AIExpert, Micro, Graphics)
I'm curious. Are they leechos because they were started later or
because they're not theoretically deep or what? From a mechanical view,
they're certainly professionally run. Their editors discuss proofs on
the phone. They turn stuff around fast. In my sole experience with
CACM, a subeditor lost my submission, ignored repeated letters and
calls, and published a later, poorer, submission in the same area.
However, when the chairman of the pub board straightened things out,
they printed an apology to me as a footnote, 3 years to the month after
the submission.
My current CACM gripe is that their papers ignore all rules of good
writing and style. Often after reading the abstract, intro, and
summary, I still have no idea what the paper's contribution is. Perhaps
this is because often the 10 page paper could be replaced by a 1 page
note with equivalent info content. For this I strongly blame the
editor and reviewers.
It seems the real leeches are the industry journals with high
subscription fees and page charges that reputedly sometimes publish
papers disrecommended by the volunteer reviewers because they have a
quota to fill.
--------
Wm. Randolph Franklin
Internet: wrf@ecse.rpi.edu (or @cs.rpi.edu) Bitnet: Wrfrankl@Rpitsmts
Telephone: (518) 276-6077; Telex: 6716050 RPI TROU; Fax: (518) 276-6261
Paper: ECSE Dept., 6026 JEC, Rensselaer Polytechnic Inst, Troy NY, 12180
∂11-Jun-90 1222 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU LICS Mailing list
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 12:19:46 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA17373; Mon, 11 Jun 90 12:04:33 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01246; Mon, 11 Jun 90 12:06:30 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24672; Mon, 11 Jun 90 12:06:14 -0700
Message-Id: <9006111906.AA24672@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 1852; Mon, 11 Jun 90 13:31:37 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
1833; Mon, 11 Jun 90 13:31:35 CDT
Date: Mon, 11 Jun 90 14:22:06 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
LICS@B.GP.CS.CMU.EDU
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: LICS%b.gp.cs.cmu.edu@VM1.NoDak.EDU
Subject: LICS Mailing list
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
MAILING LIST FOR LOGIC IN COMPUTER SCIENCE
As of Fall 1990 only people on a new LICS database will receive
directly announcements about the IEEE Logic in Computer Science
Conferences.
If you are interested in receiving such information,
please fill out the form below and return it by email
(or physical mail), by July 8 if possible.
If you are NOT INTERESTED, please tell us by return email,
so as to spare us the cost of approaching you by physical mail
after that date.
PLEASE FORWARD this message to potentially interested persons
who you suspect might not be on our present mailing list.
We apologize for multiple copies of this message.
Thank you.
lics@cs.cmu.edu
Logic in Computer Science
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
===================================
NAME (first, middle initial, last):
POSTAL ADDRESS:
EMAIL ADDRESS(ES):
*******
Would you be satisfied with receiving LICS CALLS FOR PAPERS
(and similar announcements) via EMAIL ONLY? (yes/no)
Would you be satisfied with receiving FINAL PROGRAMS and
REGISTRATION FORMS via email only? (yes/no)
[Note: you will need to print registration forms and send
them along with a check by PHYSICAL mail].
*******
Optional information (might be used in relation to paper submittals):
--------------------
PHONE:
FAX/TELEX:
∂11-Jun-90 1427 keyes@sierra.Stanford.EDU FACULTY MEETING
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 14:27:13 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Mon, 11 Jun 90 14:21:48 PDT
Date: Mon, 11 Jun 90 14:21:48 PDT
From: keyes@sierra.Stanford.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.Stanford.EDU
Subject: FACULTY MEETING
Message-Id: <CMM.0.88.645139306.keyes@>
There will be a FACULTY MEETING to vote on degree conferral:
FRIDAY, JUNE 15th
11:00 AM
McCULLOUGH 240
∂11-Jun-90 1700 ingrid@russell.stanford.edu Mailing List for Logic in Computer Science
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 16:59:56 PDT
Received: from localhost by russell.Stanford.EDU (4.1/inc-1.0)
id AA10913; Mon, 11 Jun 90 17:00:02 PDT
Message-Id: <9006120000.AA10913@russell.Stanford.EDU>
To: researchers@russell.Stanford.EDU
Subject: Mailing List for Logic in Computer Science
Date: Mon, 11 Jun 90 17:00:01 -0700
From: ingrid@russell.stanford.edu
Below is a message regarding the mailing list for Logic in Computer
Science announcements. Please accept my apologies if you receive this
more than once, but the "researchers" mailing list seemed to be the
best list to pass on the message.
Ingrid
------- Forwarded Message
Return-Path: @Sunburn.Stanford.EDU:meyer@theory.lcs.mit.edu
Return-Path: <@Sunburn.Stanford.EDU:meyer@theory.lcs.mit.edu>
Received: from Sunburn.Stanford.EDU by russell.Stanford.EDU (4.1/inc-1.0)
id AA19723; Fri, 8 Jun 90 18:12:42 PDT
Received: from THEORY.LCS.MIT.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA25007; Fri, 8 Jun 90 18:08:14 -0700
Received: from stork (STORK.LCS.MIT.EDU) by theory (4.0/TOC-1.2S)
id AA07357; Fri, 8 Jun 90 20:05:13 EDT
Received: by stork (4.0/TOC-1.2C)
id AA26673; Fri, 8 Jun 90 20:05:15 EDT
Date: Fri, 8 Jun 90 20:05:15 EDT
Message-Id: <9006090005.AA26673@stork>
To: types@theory.lcs.mit.edu, concurrency@theory.lcs.mit.edu,
logic@theory.lcs.mit.edu
Subject: LICS: please respond
>From: LICS@b.gp.cs.cmu.edu
Sender: meyer@theory.lcs.mit.edu
Date: Fri, 8 Jun 90 17:31:40 EDT
MAILING LIST FOR LOGIC IN COMPUTER SCIENCE
As of Fall 1990 only people on a new LICS database will receive
directly announcements about the IEEE Logic in Computer Science
Conferences.
If you are interested in receiving such information,
please fill out the form below and return it by email
(or physical mail), by July 8 if possible.
If you are NOT INTERESTED, please tell us by return email,
so as to spare us the cost of approaching you by physical mail
after that date.
PLEASE FORWARD this message to potentially interested persons
who you suspect might not be on our present mailing list.
We apologize for multiple copies of this message.
Thank you.
lics@cs.cmu.edu
Logic in Computer Science
School of Computer Science
Carnegie Mellon University
Pittsburgh, PA 15213
===================================
NAME (first, middle initial, last):
POSTAL ADDRESS:
EMAIL ADDRESS(ES):
*******
Would you be satisfied with receiving LICS CALLS FOR PAPERS
(and similar announcements) via EMAIL ONLY? (yes/no)
Would you be satisfied with receiving FINAL PROGRAMS and
REGISTRATION FORMS via email only? (yes/no)
[Note: you will need to print registration forms and send
them along with a check by PHYSICAL mail].
*******
Optional information (might be used in relation to paper submittals):
- - --------------------
PHONE:
FAX/TELEX:
- ------- End of Forwarded Message
∂11-Jun-90 1815 @Sunburn.Stanford.EDU:shankar@argon.csl.sri.com Special logic lunch: Wed. June 13 w/Carolyn Talcott 12noon SRIBN182
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 18:15:25 PDT
Received: from argon.csl.sri.com by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07150; Mon, 11 Jun 90 18:15:15 -0700
Received: by argon.csl.sri.com at Mon, 11 Jun 90 18:15:10 -0700.
(5.61.14/XIDA-1.2.8.27) id AA06678 for logic@cs.stanford.edu
Date: Mon, 11 Jun 90 18:15:10 -0700
From: Natarajan Shankar <shankar@csl.sri.com>
Message-Id: <9006120115.AA06678@argon.csl.sri.com>
To: sri-logic@csl.sri.com, logic@cs.stanford.edu
Subject: Special logic lunch: Wed. June 13 w/Carolyn Talcott 12noon SRIBN182
Carolyn will speak on
``Program Equivalence for Scheme/Lisp/ML-like languages:
progress and new directions''
Bring your own lunch. Non-SRI attendees need to sign in at the
reception of Bldg. A and ask for Shankar (859-5272).
East bloc attendees should contact me as early as possible.
-Shankar
∂11-Jun-90 2156 @Sunburn.Stanford.EDU:howard@Neon.Stanford.EDU talk on synthesizing reactive processes
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 11 Jun 90 21:55:58 PDT
Received: from Neon.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA08493; Mon, 11 Jun 90 21:55:54 -0700
Received: by Neon.Stanford.EDU (5.61/25-eef) id AA04871; Mon, 11 Jun 90 21:55:52 -0700
Date: Mon, 11 Jun 1990 21:55:51 PDT
From: Howard Wong-Toi <howard@Neon.Stanford.EDU>
To: logic@cs.Stanford.EDU
Subject: talk on synthesizing reactive processes
Message-Id: <CMM.0.88.645166551.howard@Neon.Stanford.EDU>
Time: Thursday, June 14, 11-11:40 am
Place: Margaret Jacks Hall, Room 301
Speaker: Howard Wong-Toi
Synthesizing Processes and Schedulers
from Temporal Specifications
David L. Dill and Howard Wong-Toi
Stanford University
We examine two closely related problems: synthesizing processes to
satisfy temporal specifications of reactive systems, and the
synthesis of a scheduler to interact with and control a group of
processes in order to meet a specification. Processes communicate
through shared and distributed variables, either synchronously or
asynchronously. In the finite state case, processes and specifications
are arbitrary $\omega$-regular languages, and both synthesis
problems are solvable in doubly exponential time and space.
The framework we present is flexible enough to incorporate discrete
time into the model of concurrency, thereby allowing us to study
the synthesis of real-time schedulers. For real-time specifications,
there can be an additional exponential blowup in the number of bits
used to encode integer timing constraints in the specification.
∂12-Jun-90 1151 @Sunburn.Stanford.EDU:E1.I85@Forsythe.Stanford.EDU
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jun 90 11:51:03 PDT
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA20256; Tue, 12 Jun 90 11:52:13 -0700
Message-Id: <9006121852.AA20256@Sunburn.Stanford.EDU>
Date: Tue, 12 Jun 90 11:53:24 PDT
To: jmc@cs.stanford.edu
From: "Voy Wiederhold" <E1.I85@Forsythe.Stanford.EDU>
Dear John and Carolyn,
We would like to invite you to a party after the graduation
on Sunday for Peter Rathmann. It will be at our house in Palo Alto
at 3PM with Chinese food etc. Please bring your little one too.
Our address is 471 Matadero Ave. (about 1/2 mi. south of
Page Mill on the East side of EC).
Hope you can come.
Voy
∂12-Jun-90 1245 @Sunburn.Stanford.EDU:marty@cis.Stanford.EDU Advanced Engineers Degree
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jun 90 12:45:42 PDT
Received: from CIS.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21300; Tue, 12 Jun 90 12:46:07 -0700
Received: by cis.Stanford.EDU (5.57/Ultrix2.4-C)
id AA19696; Tue, 12 Jun 90 12:45:57 PDT
Date: Tue, 12 Jun 90 12:45:57 PDT
From: marty@cis.Stanford.EDU (Marty Tenenbaum)
Message-Id: <9006121945.AA19696@cis.Stanford.EDU>
To: nilsson@cs.Stanford.EDU
Cc: faculty@cs.Stanford.EDU
Subject: Advanced Engineers Degree
Nils,
Gio asked me to say a few words at this today's faculty meeting in support
of an Advanced Engineers degree program. As I am unable to attend, I
would like to take this opportunity to go on record strongly in support of
such a program. There are three compelling justifications:
1. The market strongly endorses such training, as evidenced by the
insatiable demand for Berkeley and MIT masters students.
2. A masters degree with practicum training is far more valuable to
the student than pure coursework. I went through the MIT masters program
and, like most students, felt the project work was, by far, the most
valuable part of the program.
3. The research that Gio and I do necessitates lots of system
building, at a level suitable for masters students. While these
systems provide rich contexts for Ph.D. research, they have placed an
unnecessary burden on Ph.D. students who must build and maintain them.
(also, the department is too small to admit enough Ph.D. students to
do all the required work.)
I therefore strongly endorse an Advanced Engineers degree and would be
willing to serve on a committee constituted to implement such a program.
JMT.
∂12-Jun-90 1338 turner@sierra.Stanford.EDU Summer Timeschedules
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jun 90 13:38:30 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Tue, 12 Jun 90 13:37:04 PDT
Date: Tue, 12 Jun 90 13:37:04 PDT
From: turner@sierra.Stanford.EDU (Sherry A. Turner)
To: ee-faculty@sierra.Stanford.EDU
Cc: ee-adminlist@sierra.Stanford.EDU
Subject: Summer Timeschedules
Message-Id: <CMM.0.88.645223022.turner@>
The Summer Timeschedules are available for you to pick up in McCullough 150.
Thanks!
-Sherry-
∂12-Jun-90 1529 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU COLT '90
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jun 90 15:26:30 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA19284; Tue, 12 Jun 90 15:11:16 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25859; Tue, 12 Jun 90 15:13:18 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27464; Tue, 12 Jun 90 15:11:40 -0700
Message-Id: <9006122211.AA27464@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7596; Tue, 12 Jun 90 16:30:57 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7582; Tue, 12 Jun 90 16:30:53 CDT
Date: Tue, 12 Jun 90 17:23:12 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Mark Fulk <fulk@cs.rochester.edu>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Mark Fulk <fulk%cs.rochester.edu@VM1.NoDak.EDU>
Subject: COLT '90
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
COLT '90
The Third Workshop on Computational Learning Theory
Stouffer's Rochester Plaza Hotel
Rochester, NY
August 6-8, 1990
Sponsored by ACM SIGACT and SIGART
COLT '90 features 36 papers and one invited address (by Rusins Freivalds
of Latvian State University). Many papers address learnability and
non-learnability, as well as resource consumption and robustness against
bad data in new and existing computational learning models. Other papers
make theoretical comparisons of learning models, or connect learning theory
with work in neural nets and complexity theory. Models considered include
pac-learnability, mistake-bound models, recursion-theoretic inductive
inference, and other new and classical models. This is the largest COLT
program so far, and, in the humble opinion of at least one program
committee member, it is also the best.
The registration fee is $150 ($75 for students). This fee covers a banquet,
reception (August 5), refreshments, and the proceedings. Participants
are expected to find their own lunches. The hotel food is excellent, and
there are several very good restaurants in the immediate area.
The registration deadline for the conference is July 10; this is also
the last date to guarantee a reservation at the conference rate at
the hotel.
Chair and local arrangements: Mark A. Fulk (U. Rochester).
Program committee: John Case (U. Delaware, chair),
Dana Angluin (Yale),
Eric Baum (NEC Research, Princeton)
Shai Ben-David (Technion, Israel),
Mark Fulk (U. Rochester),
David Haussler (UC Santa Cruz),
Leonard Pitt (U. Illinois),
Ronald Rivest (MIT),
Carl Smith (Maryland),
Scott Weinstein (U. Pennsylvania).
Program
Monday, August 6
Session 1, 8:40 - 10:00 am, David Haussler, chair
8:40 Identifying mu-Formula Decision Trees with Queries,
by Thomas R. Hancock
9:00 Learning Switch Configurations,
by Vijay Raghavan and Stephen R. Schach
9:20 Learning Conjunctions of Horn Clauses,
by Dana Angluin, Michael Frazier, and Leonard Pitt
9:40 Exact Identification of Circuits Using Fixed Points of
Amplification Functions,
by Sally Goldman, Michael J. Kearns, and Robert E. Schapire
Session 2, 10:40 - 12:00 am, Leonard Pitt, chair
10:40 Efficient Distribution-free Learning of Probabilistic Concepts,
by Michael Kearns and Robert E. Schapire
11:00 On the Computational Complexity of Approximating Distributions
by Probabilistic Automata,
by Naoki Abe and Manfred K. Warmuth
11:20 A Learning Criterion for Stochastic Rules,
by Kenji Yamanishi
11:40 On the Complexity of Learning Minimum Time-Bounded Turing Machines,
by Ker-I Ko
Session 3, 2:00 - 3:20 pm, Scott Weinstein, chair
2:00 Inductive Inference from Positive Data is Powerful,
by Takeshi Shinohara
2:20 Inductive Identification of Pattern Languages with
Restricted Substitutions,
by Keith Wright
2:40 Pattern Languages Are Not Learnable,
by Robert Schapire
3:00 On Threshold Circuits for Parity,
by Ramamohan Paturi and Michael E. Saks
Session 4, 3:40 - 5:00 pm, Carl Smith, chair
Invited Presentation by Rusins Freivalds,
Latvian State University, Riga
Tuesday, August 7
Session 5, 8:40 - 10:00 am, Eric Baum, chair
8:40 On Learning Ring-Sum-Expansions,
by Paul Fischer and Hans Ulrich Simon
9:00 Learning Functions of k Terms,
by Avrim Blum and Mona Singh
9:20 On the Sample Complexity of Pac-Learning using Random
and Chosen Examples,
by Bonnie Eisenberg and Ronald L. Rivest
9:40 On the Complexity of Learning from Counterexamples of
Membership Queries,
by Wolfgang Maass and Gyorgy Turan
Session 6, 10:40 - 12:00 am, John Case, chair
10:40 Robust Separations in Inductive Inference,
by Mark A. Fulk
11:00 Finite Learning by a "Team",
by Sanjay Jain and Arun Sharma
11:20 Some Problems of Learning with an Oracle,
by Efim B. Kinber
11:40 A Mechanical Method of Successful Scientific Inquiry,
by Daniel N. Osherson, Michael Stob, and Scott Weinstein
Session 7, 2:00 - 3:20 pm, Dana Angluin, chair
2:00 Separating PAC and Mistake-Bound Learning Models over the
Boolean Domain,
by Avrim Blum
2:20 Boosting a Weak Learning Algorithm by Majority,
by Yoav Freund
2:40 On the Sample Complexity of Weak Learning,
by Sally Goldman, Michael J. Kearns, and Robert E. Schapire
3:00 Learning by Distances,
by Shai Ben-David, Alon Itai, and Eyal Kushilevitz
Session 8, 3:40 - 5:00 pm, Ron Rivest, chair
Informal presentations
Wednesday, August 8
Session 9, 8:40 - 10:00 am, Ron Rivest, chair
8:40 The Learnability of Formal Concepts,
by Martin Anthony, John Shawe-Taylor, and Norman Biggs
9:00 A Polynomial Time Algorithm That Learns Two Hidden Unit Nets,
by Eric B. Baum
9:20 Composite Geometric Concepts and Polynomial Predictability,
by Phil Long and Manfred K. Warmuth
9:40 Learning Integer Lattices,
by David Helmbold, Robert Sloan, and Manfred Warmuth
Session 10, 10:40 - 12:00 am, Mark Fulk, chair
10:40 On the Number of Examples and Stages Needed for Learning
Decision Trees,
by Hans Ulrich Simon
11:00 Learning DNF under the Uniform Distribution in Quasi-polynomial Time,
by Karsten Verbeurgt
11:20 Learning via Queries with Teams and Anomalies,
by William I. Gasarch, Efim Kinber, Mark Pleszkoch,
Carl Smith, and Thomas Zeugmann
11:40 Learning via Queries in [+, <],
by William Gasarch, Mark Pleszkoch, and Robert Solovay
Session 11, 2:00 - 3:20 pm, Shai Ben-David, chair
2:00 On the Sample Complexity of Finding Good Search Strategies,
by Pekka Orponen and Russell Greiner
2:20 Minimum Consistent Inference of Random Walks,
by Javed A. Aslam and Ronald L. Rivest
2:40 Aggregating Strategies,
by Volodimir G. Vovk
3:00 A DNA Sequencing Theory,
by Ming Li
Session 12, 3:40 - 5:00 pm, Mark Fulk, chair
Informal presentations
Getting To Rochester
By airplane:
The best airline is USAIR, followed by American. Travellers from outside
the US should consider flying by way of Toronto, Montreal, or Boston,
rather than attempting to make connections in New York. Once in the
Rochester airport, find the Stouffer's courtesy phone (there is one in
each concourse, in the bank of courtesy phones) and call for the shuttle.
They will direct you from there. The shuttle runs from 6:00 a.m. to
midnight, and no flights are scheduled after midnight, so you should not
have to take a taxi; however, if you must, a taxi to the hotel costs
about $14.50.
If you drive from the airport, the simplest, although not most pleasant,
route is: turn right out of the airport entrance onto Brooks Avenue,
going north. Continue on Brooks over the highway and through a
residential neighborhood until Brooks ends at Plymouth Avenue, by
the Genesee river. Turn left and take Plymouth north to Ford Street,
where it appears to end; turn right and then immediately left onto
Exchange Street. Continue north on Exchange to downtown. You will
pass under a highway; three lights further north Exchange becomes
State Street as it crosses West Main Street. The hotel is on your right,
shortly after Main Street.
Driving:
If coming from the west on Interstate 90, take exit 47 (Leroy and I-490).
Continue east on I-490 to downtown Rochester. Take exit 13 (Plymouth Avenue
and the Inner Loop), veering right to get Plymouth. Turn right (south)
on Plymouth; take the next left (Church), drive two blocks to State Street,
then turn right. The hotel will be to your left within a hundred yards.
If coming from the east on I-90, take exit 45 (Victor and I-490). Continue
west to downtown Rochester; take exit 11 to Clinton Avenue North. Take the
second left onto Broad Street, go through three lights, cross the river, and
take the first right after the river onto Exchange Street. Go north on
Exchange through one light (Main Street), at which it becomes State Street.
The hotel will be on your right shortly after Main Street.
If coming from the south on I-390, keep left (on I-390, to the Airport and
Greece) at the I-390/590 split. Take exit 16 to East and West Henrietta
Roads; the exit comes up right after the split. Keep going straight through
the light at the top of the ramp, bear right at the fork, and turn right at
the light on West Henrietta Road. You will go through about five lights
before you each Ford Street; once there, turn left to cross the Genesee
River. Take the first right after the bridge (Exchange Street); continue
north to downtown. You will pass under a highway; three lights later, at
Main Street, Exchange becomes State Street; the hotel is another few
hundred feet on the right.
Hotel Reservations
You may register by sending the form below, or by calling 1-716-546-3450.
The Stouffer's 800 number, 1-800-HOTELS1, can take your reservation but
does not know about the conference rate. Your reservation must be received
by July 10, 1990, in order to guarantee the conference rate.
If enough students request, we will form quads to save costs. We will
use the attributes male/female and smoking/non-smoking to form the quads.
Any students requesting this service should let us know by July 1, so that
we have enough time to process the request. Conference funds may be used
to pay for the odd spaces.
Family Activities
The New York wine country is one hour south of Rochester. Niagara Falls
is one and a half hours west. There are a number of beaches along Lake
Ontario; Hamlin Beach State Park, half an hour west, is probably the best.
Durand Eastman Park is surprisingly wild considering that it is officially
in the city limits. There are some parks and a zoo along the Genesee
River gorge north of downtown; the (pedestrian) Pont des Rennes offers a
nice view of the falls, and is just a few blocks from the hotel.
Rochester has several good museums: Eastman House, the home of the
founder of Kodak, has tours; it also houses the International Museum
of Photography and the Dryden Theatre. The Toronto Film Festival will
be at the Dryden on the first day of the conference. The University's
Memorial Art Gallery contains a fine collection of Mannerist paintings.
The Rochester Museum and Science Center has a planetarium and various
exhibits.
The Eastman School of Music has a regular schedule of concerts. Other
local arts groups include the GeVa theatre and The Bucket dance group.
The Genesee Country Museum is about 45 minutes south of town, in Mumford;
it is a large collection of eighteenth and nineteenth century buildings
and houses, including blacksmiths, breweries, and the like. There are
almost always exhibits of crafts from the period covered, and are also
frequent farm fairs. The country museum is popular with children; we
will organize a trip to it for families if enough people express an
interest. Normally, admission is $4.50/adult, free for small children.
Third Annual Workshop on Computational Learning Theory
Rochester, NY
Registration Form
Name _________________________________________________________
Affiliation __________________________________________________
Electronic Mail Address ______________________________________
Address ______________________________________________________
______________________________________________________________
______________________________________________________________
Telephone Number _____________________________________________
Are you a student? _________
Would you like to be grouped with two roommates? _____
If yes, indicate: Smoker/Nonsmoker _______ Male/Female_______
Are you (or your family) interested in a day trip to the
Genesee Country Museum? __________
If you would like extra banquet tickets ($35),
please indicate how many _____
Indicate any dietary restrictions:
Kosher _____ Vegetarian _____ Other ____________________
Registration Fee: $150 ____ $75 (students only) ____
Total enclosed (checks or money orders only please): __________
Mail to: COLT '90
c/o Mark Fulk
Computer Science Department
University of Rochester
Rochester, NY 14627
Room Reservation for COLT '90, August 6-8
Name: _________________________________________________________
Company: ______________________________________________________
Address: ______________________________________________________
_______________________________________________________________
_______________________________________________________________
_______________________________________________________________
Telephone number: _____________________________________________
Sharing room with: ____________________________________________
Arrival date and time: ________________________________________
Number of nights to reserve: __________________________________
To guarantee your reservation, a credit card (American Express,
Visa, Mastercard, Discover, Diner's Club, or Carte Blanche):
___________________________________________ Expires: __________
Signature: ____________________________________________________
You may also send a check or money order for the first night's
rate in order to guarantee your reservation.
Please indicate your room preference:
Single ($74/night) ____ Double ($80/night) ____
Triple ($86/night) ____ Quad ($92/night) ____
Club Floor ($104/night) ____
One Bedroom Suite ($225/night) ___
Two Bedroom Suite ($315/night) ___
Quoted prices do not include 11% state sales tax. Checkout
time is 1:00 p.m.; rooms become available for checkin at
3:00 p.m. Your deposit is refundable only if you cancel 48
hours in advance. Be sure to get a cancellation number.
Mail to: Stouffer Rochester Plaza
70 State St.
Rochester, NY 14614
∂12-Jun-90 1530 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU library cataloging of conference proceedings
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 12 Jun 90 15:28:23 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA19291; Tue, 12 Jun 90 15:13:12 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA25935; Tue, 12 Jun 90 15:15:15 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA27535; Tue, 12 Jun 90 15:13:47 -0700
Message-Id: <9006122213.AA27535@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 7680; Tue, 12 Jun 90 16:31:34 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
7667; Tue, 12 Jun 90 16:31:29 CDT
Date: Tue, 12 Jun 90 17:26:53 -0400
Reply-To: Ronald Greenberg <rig%umiacs.umd.edu@VM1.NoDak.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-C@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-C@NDSUVM1
From: Ronald Greenberg <rig%umiacs.umd.edu@VM1.NoDak.EDU>
Subject: library cataloging of conference proceedings
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Wow, librarians seem to have really botched the cataloging of several
conference proceedings such as STOC, probably FOCS, and others that
may be of interest to a smaller segment of our community such as DAC
(ACM/IEEE Design Automation Conference) and ICCAD (IEEE International
Conference on Computer-Aided Design). They can potentially occur
under a different call number every year. Below is a partial table of
cataloging here at the Engineering/Science library at the University
of Maryland. I have spent several hours trying to track these things
down, but the librarians here tell me that call numbers are pretty
much standardized across different universities, so maybe we could
collectively make a table that would be useful to all of us.
According to the librarians here, there is some kind of database into
which different institutions enter things and then if the people here
find a match in that database, that's how they catalog the item. (Of
course, a way around all of this is a small reading room that
disregards the usual call numbers and organizes things logically. But
the "program library" here has only recently started getting the
proceedings for all the right conferences.)
As it stands here right now, finding a conference proceedings involves
first puzzling out how it was put onto the online system. For
example, DAC is found by looking for "Design Automation Conference" as
the *author* rather than *title*. Somewhat similarly, most of the
STOC proceedings are found by looking for "ACM Symposium on Theory of
Computing" as the author, but there are gaps: 1969-71, 1975-78, and
1980. Once you find the right stuff online, you have to request the
expanded listing of each individual item to see what the call number
is. All of this is terribly slow and laborious.
It would be nice if we could convince everybody to consolidate each
conference onto a single call number, but I don't know how we could
possibly do that. The U. of Maryland library said I could write to
them asking for this, and maybe they would make a local fix, but they
couldn't guarantee that they would be able to spend that kind of time,
and they can't change the disparate listings of that shared database.
Barring any major change by the librarians of the world, the best I
can see us doing right now is to make a table of the call numbers in
use for each proceedings of each of the interesting conferences.
Below is a start, and I would appreciate further contributions.
I would also appreciate any further enlightening information about the
cataloging process. Every time I talk to one of these librarians, I'm
not sure if I should believe what they tell me, because it is so hard
for me to believe that they would catalog the same proceedings under
different numbers in different years and not fix the problem.
DAC:
1978 QA76.1.S1
1980 QA76.1.S1
1984 TJ212.D4
1985 T59.5.D45
Most other years I think are TA174.D45 or TA174.D46, but I
unfortunately didn't copy down the details for those years.
ICCAD:
1983-88 TK7874.I3235
other years ?
FOCS:
A few years are under QA75.5.S97, but I don't remember which.
I don't know where others might be.
STOC:
I found a single volume under each of QA75.5.A14, QA76.5.A22, and
QA76.A15.
Ron Greenberg
rig@umiacs.umd.edu
∂13-Jun-90 0821 gotelli@Sunburn.Stanford.EDU STEAM TO MJH SHUT DOWN FOR TODAY
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 08:21:29 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA13280; Wed, 13 Jun 90 08:21:28 -0700
Date: Wed, 13 Jun 1990 8:21:28 PDT
From: Lynn Gotelli <gotelli@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU, mjhstaff@Sunburn.Stanford.EDU
Cc: gotelli@Sunburn.Stanford.EDU, tom@Sunburn.Stanford.EDU
Subject: STEAM TO MJH SHUT DOWN FOR TODAY
Message-Id: <CMM.0.88.645290488.gotelli@Sunburn.Stanford.EDU>
I was just informed a few minutes ago by O & M that the steam supply
to Margaret Jacks Hall and neighboring buildings would be turned off
for most of today Wednesday, June 13th for repair of a leak in the
line to the building. I was told that by turning off the steam to
the building would not cause any change to the air conditioning system
or temperatures in the building.
If you should notice a dramatic change in temperature please let me
know immediately.
Thank you,
Lynn Gotelli, 3-4838
gotelli@cs
∂13-Jun-90 0917 pollock@Sunburn.Stanford.EDU Summer salary 1990
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 09:17:10 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14807; Wed, 13 Jun 90 09:18:11 -0700
Date: Wed, 13 Jun 1990 9:18:11 PDT
From: "Laura L. Pollock" <pollock@Sunburn.Stanford.EDU>
To: ac@cs.Stanford.EDU
Subject: Summer salary 1990
Message-Id: <CMM.0.88.645293891.pollock@Sunburn.Stanford.EDU>
Please inform me of your summer salary support, if applicable, for the
summer of 1990. I will need the account number to be charged, ie;
grant account number or unrestricted account number as well as amount,
ie; 1/9th, 2/9ths, or 3/9ths. Please note that summer support is for
the months of July, August and September only.
I would like to be sure your payments are on time therefore your
earliest response to this request would be greatly appreciated.
Thanks.
Laura
∂13-Jun-90 0925 stager@Sunburn.Stanford.EDU Grade Sheets (Reminder)
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 09:25:22 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14921; Wed, 13 Jun 90 09:25:20 -0700
Date: Wed, 13 Jun 1990 9:25:20 PDT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Cc: sec@Sunburn.Stanford.EDU, instructor-sec@Sunburn.Stanford.EDU,
tas@Sunburn.Stanford.EDU, stager@Sunburn.Stanford.EDU
Subject: Grade Sheets (Reminder)
Message-Id: <CMM.0.88.645294320.stager@Sunburn.Stanford.EDU>
Please remember that the orange grade sheets (for graduating students) are
due no later than NOON, TOMORROW (THURSDAY).
All other grade sheets are due no later than noon, Monday (June 18). Please
return all grade sheets to Claire Stager via the CS-TAC box at MJH, via
ID mail to CSD Tresidder Room 101 (Mail Code 3068), or via US mail to
CSD Tresidder Room 101, Stanford, CA 94305-3068.
Thanks again.
Claire
∂13-Jun-90 1009 bergman@Sunburn.Stanford.EDU excerpt from SPO Campus Report column, June 13, 1990
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 10:08:55 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17101; Wed, 13 Jun 90 10:09:09 -0700
Date: Wed, 13 Jun 1990 10:09:08 PDT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: excerpt from SPO Campus Report column, June 13, 1990
Message-Id: <CMM.0.88.645296948.bergman@Sunburn.Stanford.EDU>
SPONSORED PROJECTS OFFICE
_____________________________________________________________________
These funding announcements have just been received in the Sponsored
Projects Office. Application information may be obtained by
contacting Bonnie Hale at 723-4237 or as.bth@Forsythe.
____________________________________________________________________
National Science Foundation Instrumentation Grants for Research in
Computer and Information Science
Grants for the purchase of special-purpose equipment,
instrumentation or software for research in areas of science or
engineering supported in the CISE directorate. Deadline: Aug. 6,
1990.
DARPA Broad Agency Announcement 90-13: "Research in Information
Science and Technology"
For research on various aspects of networking, especially exploring
very high speed (gigabit and terabit per second) networking; the
design and implementation of networking algorithms and applications
for near-term enhancements to the Internet; approaches to network
integrity, access control, and privacy; innovative networking
experiments for using the high-capacity channel of NASA's planned
Advanced Communications Technology Satellite and short-term design
studies, including options to implement prototypes, of
ground-terminal technology. Deadline: Aug. 17, 1990.
∂13-Jun-90 1014 bergman@Sunburn.Stanford.EDU [AS.BTH@Forsythe.Stanford.EDU : NSF Alliances for Minority
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 10:14:42 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA17494; Wed, 13 Jun 90 10:14:52 -0700
Date: Wed, 13 Jun 1990 10:14:51 PDT
From: Sharon Bergman <bergman@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: [AS.BTH@Forsythe.Stanford.EDU : NSF Alliances for Minority
Participation Grants ]
Message-Id: <CMM.0.88.645297291.bergman@Sunburn.Stanford.EDU>
FYI-
Sharon Bergman
---------------
Return-Path: <AS.BTH@Forsythe.Stanford.EDU>
Received: from forsythe.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA03835; Mon, 11 Jun 90 16:13:51 -0700
Message-Id: <9006112313.AA03835@Sunburn.Stanford.EDU>
Date: Mon, 11 Jun 90 16:14:53 PDT
To: bergman@sunburn.Stanford.EDU
From: AS.BTH@Forsythe.Stanford.EDU
Subject: NSF Alliances for Minority Participation Grants
Subject: NSF Alliances for Minority Participation
The following synopsis was provided by AMP. To obtain a program
brochure (NSF Publication No. 90-44) contact the program at the
number shown below or the NSF publications unit at 202/357-7861 or
electronically at pubs@nsf or pubs@nsf.gov.
-----------------------
Alliances for Minority Participation
NSF plans to support collaborations among educational institutions,
state and local governments, and the private sector to form
alliances that, over the next decade, will demonstrably increase
the number of minority students that: (i) select undergraduate
majors in S&E, (ii) attain baccalaureate degrees, and (iii)
pursue advanced studies in S&E fields. While the principal focus
of Alliances for Minority Participation (AMP) will be the
undergraduate educational experience, its activities and projects
must also give consideration and attention to the participation
of minority students at critical transition points along the S&E
educational pipeline: i.e., high school/college;
undergraduate/graduate; and graduate/research and education. It
is to be expected that projects instituted under AMP will persist
beyond the duration of the grant period and become part of a
broad-based and long-term institutional commitment to increasing
the number of minority S&E degree recipients.
AMP will be initiated in FY 1990 with planning grants. The
planning grants will be up to six-month grants, not to exceed
$40,000 from NSF, plus an equal amount in cost sharing.
Approximately 25-30 planning grants will be awarded. Planning
grants are expected to lead to AMP Implementation proposals to be
submitted to the FY 1991 competition. However, all eligible
organizations, regardless of whether or not they received a planning
grant, may submit an AMP Implementation proposal in the FY 1991
competition.
In FY 1991, approximately 10 AMP Implementation awards will be
made. Although there is no lower limit on AMP projects, NSF support
for implementation awards will not exceed $1,000,000 per year.
NSF expects to announce the planning grant awardees in July 1990
and the implementation awardees in September 1991.
The extent of cost sharing will be an important factor in
selecting awards, particularly for those institutions that have a
significant research base. At a minimum, cost sharing must grow
to exceed the amount requested from NSF during the life of the
project and may include funds from any non-Federal source.
Planning proposals must be postmarked no later than midnight
July 1, 1990. Implementation proposals must be postmarked no later
thant midnight February 28, 1991.
General inquiries concerning the AMP program should be made to
the AMP Director, National Science Foundation, Washington, DC
20550, telephone (202) 357-7552.
∂13-Jun-90 1158 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU committees
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 11:58:44 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA21271; Wed, 13 Jun 90 11:58:38 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA15221; Wed, 13 Jun 90 11:55:08 PDT
Date: Wed, 13 Jun 90 11:55:08 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006131855.AA15221@Tenaya.Stanford.EDU>
To: faculty@cs.stanford.edu
Subject: committees
Here are my recommendations for committees for 90/91. Please look the list
over and let me know if you see any problems with these suggestions.
Thanks, -Nils
------
PhD Program: Genesereth (overall chair)
Program, Policy, and Evaluation subsection. Evaluates
progress of PhD students and presides over Black Friday
proceedings. Arranges for advisers for PhD students.
Arranges CS 300 Autumn (and possibly Winter) Quarter research
seminar (where Department faculty and others describe their research
programs). Recommends PhD program policy.
Members: Genesereth (chair), Hemenway replacement, Roberts, Dill
Admissions subsection. Decides which students admitted to CSD
PhD program. Supervises PhD recruitment and welcoming.
Members: Genesereth (chair), Hemenway replacement, Roberts,
Dill, Floyd, Goldberg, McCarthy (leave Fall), Pratt, Khatib,
Winograd, Gabriel, Koza, Tenenbaum
Comprehensive Exam: Designs, administers and grades the short tests
comprising the comprehensive exams. These will be given
in early October 1990. Overall chair: Mitchell
Analysis of Algorithms Subsection: Motwani
Automata, Languages and Mathematical Theory of Computation
Subsection: Pratt (assisted by van Glabbeek)
Artificial Intelligence Subsection: Shoham (assisted by Pat Hayes)
Computer Architecture Subsection: Gupta
Software Systems Subsection: Lam
Programming Languages Subsection: Mitchell
Numerical Analysis and Databases Subsections: Golub (Leave Spring)
/Keller
Curriculum and Teaching: Decides about CSD courses. Recommends teaching
load policies. Recommends teaching on TV policies. Members: Cheriton (chair),
Roberts, Plotkin, Khatib
Facilities: Recommends plans and policies for CSD computer facilities.
Members: Wheaton (chair), Dienstbier, Gotelli, Cheriton, Levoy, Feigenbaum
MS Program: Decides which students admitted to MS program. Recommends
plans and policies for MS program. Advises MS students. Members:
Oliger (chair; leave Winter), Hemenway replacement, Roberts, Keller, Binford,
Guibas (leave Fall), Levoy, Manna, McCluskey (leave Winter and Spring),
Wiederhold
CSD Undergraduate Major: Recommends plans and policies for the major.
Arranges for advising students. Members: Roberts (chair), Manna, Ullman,
Winograd, Reges, Cleron
Math/Comp. Sci. Major: Recommends plans and policies for the major. Chair
acts as liaison to the people in charge of the major.
Advises students. Members: Roberts (chair), Floyd, Herriot
Computer Systems Engrg. Major: Recommends plans and policies for the
major. Chair acts as liaison to the people in charge of the major. Advises
students. Members: Roberts (chair), Gupta
Symbolic Systems Major: Recommends plans and policies for the major. Chair
acts as liaison to Symbolic Systems program.
Advises students. Members: Roberts (chair), Latombe, Shoham, Winograd
Library and Publications: Recommends plans and policies for CSD
library and publication matters. Members: McCarthy (chair; leave Fall),
Binford, Tajnai, Wheaton
Fellowships: Recommends student fellowship disposition. Members:
Tajnai (chair), Hemenway replacement, Pollack, Ullman
Computer Forum: Recommends plans and policies for the CSD/CSL
industrial affiliates program. Members: Miller (chair), Pratt,
Tajnai, McCluskey (Leave Winter, Spring), Wheaton
Colloquium: Organizes CSD colloquia---a series of prominent speakers
on computer science topics. Will meet on First Tuesday of every month at
4:15 pm. Organizer: Golub (Leave Spring)
∂13-Jun-90 1634 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu ICALP
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 13 Jun 90 16:33:51 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA02630; Wed, 13 Jun 90 16:34:03 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA25046; Wed, 13 Jun 90 16:34:01 PDT
Date: Wed, 13 Jun 90 16:34:01 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9006132334.AA25046@coraki.stanford.edu>
To: faculty@cs.Stanford.EDU
Subject: ICALP
If you'll be attending ICALP please get in touch with me.
-v
∂14-Jun-90 0312 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM My Weekly Weirdo (part 1)
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 14 Jun 90 03:12:50 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 524151; 14 Jun 90 06:10:13 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 126708; Thu 14-Jun-90 03:08:26 PDT
Date: Thu, 14 Jun 90 03:08 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: My Weekly Weirdo (part 1)
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900614100820.3.RWG@TSUNAMI.SPA.Symbolics.COM>
I just noticed four unilateral special cases of what George
Gasper recognized as a discrete analog of a Sonine Bessel identity.
The first is
==== 2 2 2
\ n n pi + f 2 2 2 2
> (-1) -------------- cos sqrt(n pi - f + a ) =
/ 2 2 2 2
==== (n pi - f )
n >= 0
sin(a)
2 2 cos(a) cot(f) + f ------
cos(sqrt(a - f )) a
------------------ + ------------------------ .
2 2 sin(f)
2 f
Testing this was fun. When you try to expand the summand wrt a at
f, you get powers of n in the denom, clobbering term 0. So you must
transpose term 0, then expand. (And then evaluate an infinite sum
for each power of a-f.) (And then do some trig.)
If Harley Flanders is still around, this seems like a nice question
for one of his True/False quizzes. (Just what is the current MIT
undergrad suicide rate?)
∂14-Jun-90 1125 helen@russell.Stanford.EDU Commencement
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Jun 90 11:25:08 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA11213; Thu, 14 Jun 90 11:28:34 PDT
Date: Thu 14 Jun 90 11:28:32-PDT
From: Helen Nissenbaum <HELEN@CSLI.Stanford.EDU>
Subject: Commencement
To: ssp-faculty@russell.Stanford.EDU
Message-Id: <645388112.0.HELEN@CSLI.Stanford.EDU>
Mail-System-Version: <SUN-MM(242)+TOPSLIB(128)@CSLI.Stanford.EDU>
TO: SSP faculty
FROM: Jim and Helen
We'd like to invite you to join SSP's departmental commencement
celebration. Many of our graduating seniors have asked whether they
would be seeing SSP faculty at our ceremony. We'd be delighted to
have you join us, for the duration, or even a few minutes. If you're
participating in your "home" department ceremony, why not take a bit
of time out to join us for part of SSP's?
We'll begin the "formal" part of the event at approximately 1pm, serving
snacks and drinks after that. We'll probably be there until 2:30, or so.
Location is the grassy area in back of building 60, to the right of Mem Church
(facing the church); that is, same as last year.
-------
∂14-Jun-90 1403 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Martha Pollack
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Jun 90 14:03:36 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22405; Thu, 14 Jun 90 14:04:34 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA15897; Thu, 14 Jun 90 14:01:02 PDT
Date: Thu, 14 Jun 90 14:01:02 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006142101.AA15897@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: Martha Pollack
Cc: nilsson@Tenaya.Stanford.EDU
As those of you who attended last Tuesday's faculty
meeting know, I proposed there that Martha Pollack,
an AI scientist at SRI, be appointed as a consulting
assistant professor in our department. People at the
faculty
meeting wanted some more information about Martha,
and we concluded that I would send info to the faculty
by e-mail and, based on that, people could send a vote
to Joyce (yea, nay, or abstain).
I believe Martha richly deserves to be a consulting
assistant professor in our department. She has done
excellent work in discourse theory and planning
for natural language processing. As her report shows,
she has helped our department in a number of ways.
Since we do not have anyone on the regular faculty
whose research specialty is NLP, Martha's affiliation
with our department is even more important. It also
helps our collaboration with csli. It is difficult to judge
the international ranking of researchers in NLP without
getting external letters (and we don't go to that trouble
for consulting faculty). I believe, though, that external
letters would show that among NLP people who are
4-7 years out from the PhD Martha would be close to
the top. (I'd be interested to hear if anyone has
suggestions for
researchers in her cohort who would dominate Martha.
People who are concerned about this aspect of the
appointment might
want to contact some of the csli people to get another
reading on this.)
Since Martha's consulting faculty report and vita are
a bit long, I'll send them in the immediately following
message.
Thanks for your consideration.
-Nils
∂14-Jun-90 1404 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Martha Pollack Data
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Jun 90 14:03:58 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA22426; Thu, 14 Jun 90 14:04:52 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA15900; Thu, 14 Jun 90 14:01:17 PDT
Date: Thu, 14 Jun 90 14:01:17 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006142101.AA15900@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: Martha Pollack Data
Cc: nilsson@Tenaya.Stanford.EDU
Begin forwarded message:
Thu, 14 Jun 90 11:11:13 PDT
Date: Thu, 14 Jun 90 11:12:45 PDT
From: pollack@warbucks.ai.sri.com (Martha E. POLLACK)
To: nilsson@tenaya.stanford.edu
In-Reply-To: Nils Nilsson's message of Wed, 13 Jun 90 11:40:13 PDT <
9006131840.AA15197@Tenaya.Stanford.EDU>
Subject: forms
Nils, I'll include below both the completed form you sent me and my
vita, which includes a publications list. (The vita is Latex format.)
A lot of what's on the completed form is naturally duplicated in my
vita. . . Thanks again for initiating this for me. --M
===================================
(1) Consulting Faculty Activity Report
===================================
DEPARTMENT OF COMPUTER SCIENCE
STANFORD UNIVERSITY
ACADEMIC YEAR 1989/1990
CONSULTING FACULTY ACTIVITY REPORT
Stanford occasionally appoints people from outside the University to
the rank of Consulting (Asst/Assoc/Full) Professor. In the Computer
Science Department, we have two criteria for making and renewing these
appointments. First, our consulting faculty are people whose stature
and accomplishment would arguably qualify them as being regular members
of our faculty. Second, they are people who play an active role in
the life of the Department. The entire Computer Science faculty votes
on these appointments, and while we ordinarily do not solicit letters
of evaluation, we do find it useful to inquire of proposed and
renewing consulting faculty about their activities that would
recommend them for this position. Therefore, we would like you to
fill out the attached form (which is modeled on one which our regular
faculty fill out once each year) and send it back to us along with
your current c.v. and publication list. We appreciate very much the
many contributions made by our consulting faculty and thank you for
your patience in completing this form. The completed form
can be returned to me by electronic mail.
---------------------------------------------------------------------
NAME Pollack, Martha E.
ADDRESS Artificial Intelligence Center
SRI International
333 Ravenswood Ave.
Menlo Park, CA 94025
PHONE (415)829-2037 (o); (408)737-2218 (h)
E-MAIL pollack@ai.sri.com
Teaching: (Please indicate by quarter and year, course title, number of units
and enrollment/attendance--if known.)
Courses at Stanford:
Fall 1989 CSLI Seminar/Phil. 346 Models of Rational Agency
(co-instructors: M. Bratman and S. Rosenschein)
Spring 1988 Computer Science 277 Computational Models of Discourse
(co-instructors: D. Appelt and J. Hobbs)
(See attached vita for teaching experience elsewhere.)
Seminars/Talks: (Please list any seminars, guest lectures, or other
presentations you have given at Stanford or on behalf of Stanford.)
Guest Lecturer, Computer Science 520 (Topics in Artificial Intelligence), Spring 1989, 2
Lectures on Natural-Language Processing
Speaker, NSF Site Visit for the Center for Research on Interpretive Symbolic
Processes, Winter 1990
Speaker, various site visits by the System Development Foundation to the Center for the
Study of Language and Information
Supervision of Ph.D. Candidates (Please list any students
for whom you are an adviser or on the reading committee.)
At Stanford:
Eunok Paek (Computer Science), thesis committee member.
Becky Thomas (Computer Science), proposed thesis committee member.
Elswehere:
Marc Ringuette (CMU Computer Science), proposed thesis committee member.
Presentations at Meetings and Symposia.
(Note: For more complete details, including co-authors of papers
presented, see attached vita.)
"Introducing the Tileworld: Experimentally Evaluating Agent Architectures,"
to be presented at AAAI-90, August, 1990.
"A Mid-Level Set of Benchmarks for Agent Evaluation," invited presentation to
be given at the DARPA/NASA Workshop on Benchmarks and Metrics for Evaluating
Agent Architectures, June, 1990.
"Experimental Evaluation of Agent Architectures," presentation at the AAAI
Symposium on Planning in Uncertain, Unpredictable, or Changing Environments,
March, 1990.
"Ascribing Plans to Agents," presented at IJCAI-89, August, 1989.
"Plan Recognition Beyond STRIPS," talk at Second Workshop on Plan Recognition,
August, 1989.
"An Integrated Framework for Semantic and Pragmatic Interpretation," presented at ACL-
88, June, 1988.
"A Treatment of Plan Recognition that Allows Actor's Errors," talk at the
Timberline Workshop on Reasoning about Actions and Plans, July, 1986.
"Plans as Complex Mental Attitudes," presented at the Monterey Workshop on
Intentions and Plans in Communication and Discourse, March, 1987.
"A Model of Plan Inference that Distinguishes between the Beliefs of Actors and
Observers," presented at ACL-86, June, 1986.
"Information Sought and Information Provided: An Empirical Study of User/Expert
Dialogues," presented at CHI-85, April, 1985.
"Good Answers to Bad Questions: Goal Inference in Expert
Advice-Giving," presented at CSCSI-84, May, 1984.
"On Deciding What to Say," talk at the Third Annual Workshop on Language Generation,
July, 1984.
"User Participation in the Reasoning Process of Expert Systems,"
presented at AAAI-82, August, 1982.
University Service Other Than Teaching and Research: (Include
administrative duties and committee work.)
Member of the Ph.D. Admissions Committee, Stanford CS Department, 1987.
Professional Activities Outside the University: (Include offices in
professional organizations, services to government agencies or industry,
editorship of journals, and outside administrative or
public service.)
Chair, Tutorials Program, 12th International Joint Conference on
Artificial Intelligence, 1991.
Program Committee, 28th Annual Meeting of the Association for
Computational Linguistics, 1990.
Editorial Board, Computational Linguistics, 1989-92.
Member, Association for Computing Machinery (ACM) Committee on
Scientific Freedom and Human Rights, 1989-1990.
Chair, Association for Computing Machinery (ACM) Subcommittee on the
Status of Women in Computer Science, 1989-1990. Subcommittee member, 1990-
1991.
Chair, Tutorials Program, 27th Annual Meeting of the Association
for Computational Linguistics, 1989.
Co-organizer, with P. Cohen, of the Symposium on Intentions and Plans in
Communication and Discourse, Monterey, CA, March 4-6, 1987.
Reviewer for numerous journals, conferences, and funding
organizations, including Computational Linguistics, Cognitive Science, Computing
Surveys, International
Journal of Expert Systems, PRICAI-90, ACL-90, IJCAI-89, IJCAI-87,
IJCAI-85, and the National Science Foundation.
Honors and Awards:
(Note: For list of research grants, see attached vita.)
1986 Rubinoff Dissertation Prize, University of Pennsylvania
1983-1986 IBM Graduate Fellowship
1982-1983 University of Pennsylvania Teaching Fellowship
1981-1982 University of Pennsylvania University Fellowship
1979 Phi Beta Kappa
1979 Bachelor's Degree awarded summa cum laude and
with Highest Distinction in the Major
1975-1979 Rufus Choate Scholar, Dartmouth College
If you have not yet played an active role in the Department, briefly
describe what activities you intend to engage in:
As noted in the sections above, I have played an active role in the CS
Department for the past 4 years, by teaching courses, giving guest
lectures in courses taught by other faculty members, serving on students'
thesis committees, and serving on the admissions committee. In
addition, I have been involved in more informal ways, for example, by
participating in the research group meetings of the Principia Project
and in various activities sponsored by the Stanford Women in Computer ScienceGroup. I
intend to continue my participation in similar ways.
===================================
(2) Vita
===================================
\documentstyle{article}
\setlength\oddsidemargin{.4in}
\setlength\topmargin{.25in}
\setlength\textwidth{5.5in}
\setlength\textheight{7.8in}
\setlength\parindent{0in}
%\setlength\parskip{0ex plus 1ex minus 0ex}
\setlength\leftmargin{1.2in}
\def\itemwidth{4.7in} %should be \textwidth-\leftmargin-.1in
\def\dateitem#1#2{\par\vspace{.8ex}
\parbox[t]{\leftmargin}{\hfill \it #1\ \ } \hfill
\parbox[t]{\itemwidth}{#2}\par\vspace{.8ex}}
\newcommand{\heading}[1]{\vspace{3.0ex}#1\vspace{2.0ex}}
\newenvironment{entries}{\begin{list}{\mbox{}}%
{\setlength{\leftmargin}{30pt}
\setlength{\labelwidth}{0pt}
\setlength{\parsep}{0pt}
\setlength{\topsep}{0pt}
\setlength{\itemindent}{-30pt}
\setlength{\itemsep}{.5ex}}}{%
\end{list}}
\sloppy
\pagestyle{empty}
\begin{document}
\begin{center}
{\bf MARTHA E. POLLACK}
\end{center}
\vspace{2ex}
\heading{PERSONAL:}\\
\begin{tabular}{ll}
Address: & Artificial Intelligence Center\\
& SRI International\\
& Menlo Park, CA 94025\\ \\
Telephone: & office: (415) 859-2037\\
& home: (408) 737-2218\\ \\
Citizenship: & USA
\end{tabular}
\vspace{2ex}
\heading{EDUCATION:}\\
\begin{tabular}{ll}
June 1986 & Ph.D., Computer and Information Science\\
& University of Pennsylvania\\
& Philadelphia, PA\\
& Dissertation title: {\it Inferring Domain Plans in Question-Answering}\\
June 1984 & M.S.E.E., Computer and Information Science\\
& University of Pennsylvania\\
& Philadelphia, PA\\
June 1979 & B.A., Linguistics\\
& Dartmouth College\\
& Hanover, NH\\
& Honors thesis title: {\it A Linguistic Theory of Metaphor}\\ \\
\end{tabular}
\vspace{2ex}
\heading{ACADEMIC HONORS AND AWARDS:}\\
\begin{tabular}{p{1in}l}
1986 & Rubinoff Dissertation Prize, University of Pennsylvania \\
\\
1983 -- 1986 & IBM Graduate Fellowship\\
\\
1982 -- 1983 & University of Pennsylvania Teaching Fellowship\\
\\
1981 -- 1982 & University of Pennsylvania University Fellowship\\
\\
1979 & Phi Beta Kappa\\
\\
1979 & Bachelor's Degree awarded {\em summa cum laude} and
with Highest Distinction in the Major\\
\\
1975 -- 1979 & Rufus Choate Scholar, Dartmouth College\\
\end{tabular}
\vspace{2ex}
\newpage
\heading{PRIMARY WORK EXPERIENCE:}\\
\begin{tabular}{p{2in}l}
September 1985 -- present, & Computer Scientist\\
summer 1983 & SRI International\\
& Menlo Park, CA\\
\end{tabular}
\\
\vspace{2ex}
\begin{tabular}{p{2in}l}
September 1985 -- present & Senior Researcher\\
& Center for the Study of Language and Information\\
& Stanford University\\
& Stanford, CA\\
\end{tabular}
\\
\vspace{2ex}
\begin{tabular}{p{2in}l}
February 1980 -- June 1981 & Technical Instructor\\
& Data Processing Training Services\\
& Blue Cross of Massachusetts\\
& Boston, MA\\
\end{tabular}
\\
\vspace{2ex}
\pagestyle{myheadings}
\markright{{\it Vita for M.~E. Pollack}}
\heading{OTHER PROFESSIONAL ACTIVITIES:}
\begin{entries}
\item Invited Lecturer, 1991 Summer School of Computational
Linguistics, Prague, Czechoslovakia. (Will give a 4-unit course on
discourse.)
\item Chair, Tutorials Program, 12th International Joint Conference on
Artificial Intelligence, 1991.
\item Program Committee, 28th Annual Meeting of the Association for
Computational Linguistics, 1990.
\item Editorial Board, {\it Computational Linguistics}, 1989-92.
\item Member, Association for Computing Machinery (ACM) Committee on
Scientific Freedom and Human Rights, 1989-1990.
\item Chair, Association for Computing Machinery (ACM) Subcommittee on the
Status of Women in Computer Science, 1989-1990. Subcommittee member,
1990-1991.
\item Chair, Tutorials Program, 27th Annual Meeting of the Association
for Computational Linguistics, 1989.
\item Co-organizer, with P. Cohen, of the Symposium on Intentions and Plans in
Communication and Discourse, Monterey, CA, March 4-6, 1987.
\item Member, Ph.D. Admissions Committee, Stanford UniversityComputer Science
Department, 1986-87.
\item Reviewer for numerous journals, conferences, and funding
organizations, including {\em Computational Linguistics}, {\em
Cognitive Science}, {\em Computing Surveys}, {\em International
Journal of Expert Systems}, PRICAI-90, ACL-90, IJCAI-89, IJCAI-87,
IJCAI-85, and the National Science Foundation.
\end{entries}
\vspace{2ex}
\newpage
\heading{JOURNAL ARTICLES:}
\begin{entries}
\item M.~E. Pollack, ``Plan Re-use in Practical Reasoning,'' in
preparation for submission as an invited paper to {\it Nous} (Special
Issue on Artificial Intelligence and Cognitive Science).
\item D.~E. Appelt and M.~E. Pollack, ``Weighted Abduction for Plan
Ascription'', submitted to {\it User Modeling and User-Adapted
Interaction}, May, 1990.
\item F.~C.~N. Pereira and M.~E. Pollack ``Incremental
Interpretation,'' To appear in {\em Artificial Intelligence}.
\item M.~E. Bratman, D.~J. Israel and M.~E. Pollack,
``Plans and Resource-Bounded Practical Reasoning,'' {\it Computational
Intelligence}, 4:4, 1988. (A slightly revised version will appear in
J. Pollock and R. Cummins, eds., {\em Philosophy and AI: Essays at the
Interface}, MIT Press, Cambridge, MA, in press.)
\end{entries}
\heading{REFEREED CONFERENCE PAPERS:}
\begin{entries}
\item M.~E. Pollack and M. Ringuette,
``Introducing the Tileworld: Experimentally Evaluating Agent
Architectures,'' To appear in {\em AAAI-90, Proceedings of the
National Conference on Artificial Intelligence}, Boston, MA, August,
1990.
\item K. Konolige and M.~E. Pollack,``Ascribing Plans to Agents,'' {\it IJCAI-89,
Proceedings of the 11th
International Joint Conference on Artificial Intelligence}, Detroit,
MI, August, 1989.
\item M.~E. Pollack and F.~C.~N. Pereira,``An Integrated Framework for Semantic and
Pragmatic Interpretation,''
{\it ACL-88, Proceedings of the 26th Meeting of the Association for
Computational Linguistics}, Buffalo, NY, June 1988.
\item M.~E. Pollack, ``A Model of Plan Inference that Distinguishes between the Beliefs of
Actors and Observers,'' in {\it ACL-86, Proceedings of the 24th Meeting of the
Association for Computational Linguistics}, New York, NY, June 1986.
(Also appears in M. Georgeff and A. Lansky, eds., {\it The 1986
Workshop on Reasoning about Actions and Plans}, Morgan Kaufman
Publishers, Los Altos, CA, 1987).
\item M.~E. Pollack,
``Information Sought and Information Provided: An Empirical Study of
User/Expert Dialogues,'' in {\it CHI-85, Proceedings of the Conference on
Human Factors in Computing Systems}, San Francisco, CA, April 1985.
\item M.~E. Pollack,
``Good Answers to Bad Questions: Goal Inference in Expert
Advice-Giving,'' in {\it CSCSI-84, Proceedings of the Conference of
the Canadian Society for Computational Studies of Intelligence},
London, Ontario, May 1984.
\item M.~E. Pollack, J. Hirschberg, and B. Webber,
``User Participation in the Reasoning Process of Expert Systems,'' in
{\it AAAI-82, Proceedings of the National Conference on Artificial
Intelligence}, Pittsburgh, PA, August 1982.
\end{entries}
{\heading BOOK CHAPTERS:}
\begin{entries}
\item M.~E. Bratman, D.~J. Israel and M.~E. Pollack, ``Plans and
Resource-Bounded Practical Reasoning'' (see under Journal Articles above).
\item M.~E. Pollack, ``Plans as Complex Mental Attitudes,'' in P. Cohen, J.
Morgan, and M. Pollack, eds., {\it Intentions in Communication}, MIT
Press, Cambridge, MA, 1990.
\item B.~J. Grosz, M.~E. Pollack and C.~L. Sidner,
``Discourse,'' in M. Posner, ed., {\it Foundations of Cognitive
Science}, Bradford Books, MIT Press, Cambridge, MA, 1989.
\item M.~E. Pollack,
``Some Requirements for a Model of the Plan-Inference Process in
Conversation,'' in R. Reilly, ed., {\it Communication Failure in
Dialogue and Discourse}, North-Holland, Amsterdam, 1987.
\item M.~E. Pollack, ``A Model of Plan Inference that Distinguishes
between the Beliefs of Actors and Observers'' (see under Refereed
Conference Papers above).
\end{entries}
{\heading BOOKS (edited):}
\begin{entries}
\item P.~R. Cohen, J. Morgan and M.~E. Pollack, editors,
{\it Intentions in Communication}, MIT Press, Cambridge, MA, 1990.
\end{entries}
{\heading VIDEOTAPES:}
\begin{entries}
\item ``Natural-Language Processing''. Two lectures given at Stanford
University, June, 1989. Morgan Kaufmann Publishers, San Mateo, CA.
\end{entries}
{\heading TECHNICAL REPORTS AND WORKSHOP PAPERS:}
\begin{entries}
\item D.~E. Appelt and M.~E. Pollack,``Weighted Abduction as an Inference Method for
Plan Recognition and
Evaluation,'' {\em Second International Workshop on User Modeling},
Honolulu, HI, March, 1990.
\item M.~E. Pollack and M. Ringuette,
``Introducing the Tileworld: Experimentally Evaluating Agent
Architectures'' (Extended Abstract), {\it AAAI Symposium on Planning
in Uncertain, Unpredictable, or Changing Environments}, Stanford, CA,
March, 1990.
\item M.~E. Pollack,
``Plan Recognition Beyond STRIPS'' (Extended Abstract), {\it Workshop
on Plan Recognition}, 11th International Joint Conference on
Artificial Intelligence, Detroit, MI, August, 1989.
\item F.~C.~N. Pereira and M.~E. Pollack,
``A Brief Overview of the Candide Project,''
SRI International Technical Report No. 450, 1988.
\item M.~E. Bratman, D.~J. Israel and M.~E. Pollack,``Toward an Architecture for
Resource-Bounded Agents,'' Technical
Report No. CSLI-87-104, Center for the Study of Language and
Information, Stanford, CA, August 1987.
\item M.~E. Pollack,
``Inferring Domain Plans in Question-Answering,'' University of
Pennsylvania Doctoral Thesis, Philadelphia, PA, May 1986.
\item M.~E. Pollack,
``On Deciding What to Say (When You're Asked How to Perform Some
Action),'' {\it Third Annual Workshop on Language Generation},
Stanford, CA, July 1984.
\item M.~E. Pollack,
``A Way to Talk About Propositions,'' in {\it Penn Review of
Linguistics}, Vol. 7, Philadelphia, PA, January 1983.
\end{entries}
\vspace{2ex}
\newpage
\heading{TEACHING EXPERIENCE:}\\
\begin{tabular}{ll}
Fall 1989 & Co-Instructor:\\
& Seminar on Models of Rational
Agency\\
& Center for the Study of Language and Information\\
& Stanford University (with M. Bratman
and S. Rosenschein)\\
\\
Spring 1989 & Tutorial on Natural-Language
Processing\\
& Guest Lectures in Tutorials in
Artificial Intelligence\\
& Computer Science Department\\
& Stanford University (instructor: N. Nilsson)\\
\\
Spring 1987 & Co-Instructor:\\
& Computational Models of Discourse\\
& Computer Science Department\\
& Stanford University (with D. Appelt
and J. Hobbs)\\
\\
1982 -- 1983 & Teaching Assistant:\\
& Introduction to Lisp (instructor:
B. Webber)\\
& Artificial Intelligence (instructor:
T. Finin)\\
& Data Structures (instructors: B.
Webber and P. Buneman)\\
& Computer Science Department\\
& University of Pennsylvania\\
\\
1980 -- 1981 & Instructor:\\
& Various courses in computer
programming\\
& Data Processing Training Services\\
& Blue Cross of Massachusetts\\
& Boston, MA\\
\\
\end{tabular}
\vspace{2ex}
\heading{RESEARCH GRANTS:}
\begin{entries}
\item Principal Investigator, {\it Intelligent Real-Time Problem
Solving}, AFOSR/RADC/WRDC Grant, \$85,000, 1990-1991.
\item Co-Investigator (D. Appelt and K. Konolige, PrincipalInvestigators), {\it Planning
Helpful Behavior}, Nippon Telegraph and
Telephone Grant, SRI Project 7196, \$750,000, 1989-1992.
\item Co-Investigator (K. Konolige, Principal Investigator),{\it Distributed Reasoning and
Planning}, ONR Grant, SRI Project
7363, \$400,000, 1989-1991, and SRI Project 8342, \$1,000,000, 1987-1989.
\item Co-Investigator (F.~C.~N. Pereira, Principal Investigator),{\it Candide, An Interactive
System for the Acquisition of
Domain-Specific Knowledge}, DARPA Grant, SRI Project
7783, \$1,150,000, 1985-1988.
\item Research Group Member, {\it Rational Agency Group} and {\em
Discourse, Intention, and Action Group}, Center for the Study of
Language and Information, Stanford University, Gift from the System
Development Foundation: {\it Situated Language Project}, 1985-1990.
\end{entries}
\vspace{2ex}
\heading{STUDENT ADVISING:}
\begin{entries}
\item Dissertation Committee Member, Eunok Paek, Computer Science Department,
Stanford University, Ph.D. expected December, 1990.
\item Supervisor, Marc Ringuette, Computer Science Department,
Carnegie-Mellon University, Ph.D. expected June, 1991. (Marc worked
at SRI under my supervision during the summer of 1989, and continues
to work on projects with me.)
\end{entries}
\vspace{2ex}
\heading{INVITED PARTICIPANT:}
\begin{entries}
\item DARPA/NASA Benchmarks and Metrics Workshop on Evaluating Agent
Architectures, NASA Ames Research Center, Mountain View, CA, June, 1990.
\item American Association for Artificial Intelligence (AAAI)
Symposium on Planning in Uncertain, Unpredictable, or Changing
Environments, Stanford, CA, March 1990.
\item American Association for Artificial Intelligence (AAAI) Workshop
on Plan Recognition, Detroit, MI, August 1989.
\item American Association for Artificial Intelligence (AAAI)
Symposium on AI and Limited Rationality, Stanford University,
Stanford, CA, March 1989.
\item Rochester Planning Workshop: From Formal Systems to Practical
Systems, University of Rochester, Rochester, NY, October 1988.
\end{entries}
\end{document}
∂14-Jun-90 1503 @Sunburn.Stanford.EDU:nilsson@Tenaya.Stanford.EDU Martha Pollack
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 14 Jun 90 15:03:20 PDT
Received: from Tenaya.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA24938; Thu, 14 Jun 90 15:04:19 -0700
Received: by Tenaya.Stanford.EDU (NeXT-1.0 (From Sendmail 5.52)/25-eef) id AA15979; Thu, 14 Jun 90 15:00:48 PDT
Date: Thu, 14 Jun 90 15:00:48 PDT
From: Nils Nilsson <nilsson@tenaya.Stanford.EDU>
Message-Id: <9006142200.AA15979@Tenaya.Stanford.EDU>
To: ac@cs.stanford.edu
Subject: Martha Pollack
Mike Genesereth asked that I distribute his note about Martha to the
faculty. -Nils
----
Begin forwarded message:
Date: Thu, 14 Jun 1990 14:58:13 PDT
From: Michael Genesereth <mrg@sunburn.stanford.edu>
To: Nils Nilsson <nilsson@tenaya.stanford.edu>
Subject: Re: Martha Pollack
In-Reply-To: Your message of Thu, 14 Jun 90 14:01:02 PDT
Folks,
I was unable to attend that portion of the faculty meeting at
which the appointment of Martha Pollack as consulting faculty
was discussed. If I had been there I would have vehementlyobjected. Two grounds.
First of all, we have too many consulting faculty, or perhaps
I shold say our standards have declined. When I first arrived,
it was common to hold up as standard whether or not we would appoint
the fperson to the regular faculty IF we had a slot. Last time when
I said that people laughed, knowig full well that we no longer
use that criterion. We should keep the stds high so that when
we make an appointment it means something. Maybe that way we can get the
really excellent people to feel more rewarded for their efforts on
behalf of the departmenty.
Secondly, I believe that even with our current standard, Martha
Pollack does not make the cut. On the positive side, she seems
to understand the current vogue of natural language processing andis capable of
articulating it in lectures. An dperhaps that should
suffice. However, I personally would like to see as wel a deep
understanding of issues and trends in the field, and in facta prominent role in brining about
ang changing those trends. This
second criterion is certainly characteriztic of some of the others
in our consulting faculty, e.g. Stan Rosenschein. Unfortunatelyu,
Pollack is simnply not strong in this direction. I have hadmultiple technical interactions with
her (largely amicable), inwhich I gained the impression that she is not at all deep. Sheis a
follower and is somewhat comeptent at that. But at Stanford
I think we need more.
I vote no.
mrg
∂15-Jun-90 0703 @Sunburn.Stanford.EDU:eaf@sumex-aim.stanford.edu Re: Martha Pollack
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 07:03:29 PDT
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06791; Fri, 15 Jun 90 07:04:25 -0700
Received: by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA14210; Fri, 15 Jun 90 07:06:36 PDT
Date: Fri, 15 Jun 1990 7:06:36 PDT
From: Edward A. Feigenbaum <eaf@sumex-aim.Stanford.EDU>
To: Nils Nilsson <nilsson@tenaya.stanford.edu>
Cc: ac@cs.stanford.edu
Subject: Re: Martha Pollack
In-Reply-To: Your message of Thu, 14 Jun 90 15:00:48 PDT
Message-Id: <CMM.0.88.645458796.eaf@sumex-aim.stanford.edu>
I don't want to dispute Mike's comments on Martha. I just want to make a
"technical correction", as it were. As a founding member of the department
and
an ex-chairman, let me just remark (reflect) that our standard for Consulting
Professor has NEVER been that the person had to be of the quality that could
be appointed to the regular faculty. The criterion has always been:
outstanding scientist IN INDUSTRY who devoted about one day per week to
helping us with teaching, thesis supervision, or research (in return for
which we "paid" the person with a Consulting Professor title).
We of course are free to tighten up on the definition of "outstanding", as
we wish.
Ed
∂15-Jun-90 0704 @Sunburn.Stanford.EDU:eaf@sumex-aim.stanford.edu Re: Martha Pollack
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 07:04:43 PDT
Received: from SUMEX-AIM.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06817; Fri, 15 Jun 90 07:05:49 -0700
Received: by sumex-aim.stanford.edu (4.0/inc-1.0)
id AA14236; Fri, 15 Jun 90 07:08:00 PDT
Date: Fri, 15 Jun 1990 7:07:58 PDT
From: Edward A. Feigenbaum <eaf@sumex-aim.Stanford.EDU>
To: Nils Nilsson <nilsson@tenaya.stanford.edu>
Cc: ac@cs.stanford.edu
Subject: Re: Martha Pollack
In-Reply-To: Your message of Thu, 14 Jun 90 15:00:48 PDT
Message-Id: <CMM.0.88.645458878.eaf@sumex-aim.stanford.edu>
My actual vote is:
I vote with Nils to grant Martha a Consulting Assistant Professor title.
Ed
∂15-Jun-90 0721 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU Program of SIGAL International Symposium
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 07:17:55 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22833; Fri, 15 Jun 90 07:02:29 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA01434; Fri, 15 Jun 90 07:04:36 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA06638; Fri, 15 Jun 90 06:53:00 -0700
Message-Id: <9006151353.AA06638@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2648; Fri, 15 Jun 90 08:50:57 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2631; Fri, 15 Jun 90 08:50:50 CDT
Date: Fri, 15 Jun 90 09:45:51 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
asano <asano@iscb.osakac.ac.jp>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: asano <asano%iscb.osakac.ac.jp@VM1.NoDak.EDU>
Subject: Program of SIGAL International Symposium
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
=================================================================
| SIGAL International Symposium on Algorithms |
| |
| August 16 - 18, 1990, Tokyo |
| |
| Organized by Special Interest Group on Algorithms (SIGAL) |
| of the Information Processing Society of Japan (IPSJ) |
=================================================================
Symposium Organization
Symposium Chairs: Akihiro NOZAKI (International Christian University)
Takao NISHIZEKI (Tohoku University)
Program Committee:
Toshihide IBARAKI (Kyoto University) (Chair)
Tetsuo ASANO (Osaka Electro-Comm. University) (Co-Chair)
Takao ASANO (Sophia University)
Yoshihide IGARASHI (Gunma University)
Hiroshi IMAI (Tokyo University)
Kazuo IWANO (IBM Tokyo Research Laboratory)
Tsutomu MATSUMOTO (Yokohama National University)
Tetsuo MIZOGUCHI (Mitsubishi Electric Company, Ltd.)
Katsuhiro NAKAMURA (NEC Co. Ltd.)
Hideo NAKANO (Osaka University)
Masafumi YAMASHITA (Hiroshima University)
Hiroto YASUURA (Kyoto University)
Finance: Katsuhiro NAKAMURA (NEC Co. Ltd.)
Publication, Publicity: Hiroshi IMAI (Tokyo University)
Local Arrangement Committee:
Yoshihide IGARASHI (Gunma University) (Chair)
Takao ASANO (Sophia University) (Co-Chair)
Kazuo HIRONO (CSK Corporation)
Kazuo IWANO (IBM Tokyo Research Laboratory)
Mario NAKAMORI (Tokyo University of Agriculture and Technology)
Takeshi TOKUYAMA (IBM Tokyo Research Laboratory)
Shuji Tsukiyama (Chuo University)
Shuichi UENO (Tokyo Institute of Technology)
Osamu WATANABE (Tokyo Institute of Technology)
GENARAL INFORMATION
Location and Dates
The Symposium will take place at the
CSK Information Education Center
5-1, Suwa-2-chome, Tama, Tokyo 206 JAPAN
on
August 16 (Thursday) through 18 (Saturday), 1990
Language
The official language during the symposium is English.
Registration
All participants, when they arrive at the symposium site, must go to
the registration desk to notify us of your presence and to pick up
the Symposium kit. The registration desk is open according to the
following schedule:
August 15, Wednesday 15:00-20:00
August 16, Thursday - 17, Friday 08:30-20:00
August 18, Saturday 08:30-12:00
Only preregistered participants can attend the Symposium. Those who
are going to participate the Symposium have to fill in the registra-
tion form below and return it with the payment on the registration
fee to:
Prof. Takao ASANO
Department of Mechanical Engineering
Sophia University
Kioicho 7-1, Chiyoda-ku, Tokyo 102, Japan
facsimile: +81-3-238-3885
Symposium fee
No registration will be accepted unless it is accompanied by a correct
payment of the following fee:
with accomodation 40,000 yen (registered until July 5)
with accomodation (with spouse) 70,000 yen (registered until July 5)
without accomodation 20,000 yen (registered until July 5)
without accomodation 25,000 yen (registered on and after
July 6)
'The with accomodation' class includes board, and the 'without
accomodation' class includes lunch. The registration fee includes
participation in all scientific activities and social events. The
registration fee also includes proceedings of the Symposium.
Remittance
Remittance should be made only by a bank transfer to the following
account:
Name of Account: SIGAL-ISA, representative Katsuhiro NAKAMURA
Name of Bank: Mitsui Bank, Miyamaedaira Branch (No.244)
Number of Account: 5232297
Personal checks, bank draft, traveller's checks, and credit cards are
not acceptable.
Hotel Accomodation
CSK Information Education Center, where the Symposium is to be held,
has 140 single rooms, all of which are to be used by the Symposium
attendants. As there are few hotels near the Symposium site, it is
recommended that registrants make reservation in the Center by
choosing 'with accomodation' class in the registration form. Since
the number of rooms is limited, rooms will be assigned on a first-
come-first-served basis, and registrants are kindly requested to send
the registration form at the earliest convenience. CSK Information
Education Center has a swimming pool, a tennis court, an athletic
gymnasium, and saunas, all free for the participant. The check in
time is 15:00 (Wednesday), August 15, and the check out time is 10:00,
August 19 (Sunday).
Visas
Citizens of some countries need to hold a visa to enter Japan. Please
consult your travel agent or the Japanese Consulate as to whether you
need one or not. If a document from the Organizing Committee is
necessary for you to obtain a visa, please write to
Prof. Takao NISHIZEKI
SIGAL Symposium Chairman
Department of Information Engineering,
Faculty of Engineering,
Tohoku University
Sendai 980, Japan
E-mail: nishi@jpntohok.bitnet
facsimile: +81-22-263-9301
as soon as possible, because visa procedures are usually very slow.
Climate and Clothing
Generally speaking, the climate of Tokyo in Summer is hot and humid.
The temperature in August is about 26+-4 degree in Celcius (or 78+-7
degree in Farenheit). Participants are advised to wear light clothing,
such as half-sleeve shirts. However, we recommend that you carry a
light sweater or a jacket, since the Symposium site and the main
transportation systems in Japan are air-conditioned.
SOCIAL EVENTS
Welcoming Reception
All participants and accompanying persons are invited to attend the
Welcoming Reception which will start at 18:00, August 15 (Wednesday)
at the SE Salon in the 7th floor of the Conference Building. Light
meal (e.g. sandwitches) and drinks (wine, beer, or soft drinks) will
be served. The registration fee covers this expense.
Banquet
A Banquet in Buffet STyle will be held at 18:00, August 16 (Thursday)
at the Cafeteria in the Conference Building. All participants and
accompanying persons are invited to attend the banquet. The
registration fee covers this expense.
TRANSPORTATION
>From Tokyo International Airport (Narita) to Shinjuku
As there is no means of direct transportation from Tokyo International
Airport at narita to the Symposium site, you have to move first to
Shinjuku Station in Tokyo. Airport Limousine Buses run regularly
between Airport and Shinjuku, leaving the airport every 20 minutes in
the daytime. The bus stop you have to get off is 'Shinjuku Nishiguchi.'
It takes about 120-150 minutes and costs 2,700 yen from the airport to
Shinjuku. (It will cost about 25,000 yen by a taxi, so DO NOT catch
a taxi at Narita airport.) If you are already in Tokyo or you have
taken another bus, go to Shinjuku Station by JR (Japan Railway) train,
subway, or a taxi.
>From Shinjuku to the Symposium Site
The direct transportation from Shinjuku to the Symposium site is Keio
line. When you arrive in Shinjuku, you have to fing 'Keio Shinsen
Shinjuku' (or 'Toei Shinjuku') station. Take a train for 'Tama Center'
or 'Hashimoto' and get off at 'Nagayama' station, from which the
Symposium site is within 5 minutes walk. Note that 'Keio Shinsen
Shinjuku' station is different from 'Keio Shinjuku' station, and if
you have taken a train from the latter, you have to get off at 'Chofu'
station and take another train for Tama Center or Hashimoto. Also
there are many other 'Shinjuku' stations for different lines, so you
have to be careful not to take a train other than Keio line.
Japan Railway Pass
If you have a plan of visiting several cities in Japan, it is
recommended to use the bullet train ('Shinkansen' in Japanese). The
fare is 25,940 yen for a round trip between Tokyo and Kyoto. You can
buy a special discount ticket in you country like EuRail Pass in
Europe (note that you CANNOT buy one in Japan), which is called
'Japan Railway Pass.' The price depends on the period and is about
27,000 yen for one week and 43,000 yen for two weeks. With this pass
you can take any train of Japan Railway freely. You can even reserve
a seat in bullet trains. Please ask your travel agency for detail.
Also, it is advised NOT TO travel for sightseeing in Japan before the
Symposium, especially between the 10th and the 16th in August, since
during this period traffics (trains, highways, airlines, and so on)
are terribly crowded because of religious holidays.
=================================================================
| SIGAL International Symposium on Algorithms |
| |
| August 16 - 18, 1990, Tokyo |
| |
| REGISTRATION FORM |
=================================================================
Please: 1. Fill in one form per participant,
2. Type or print,
3. Keep a copy for your record,
4. Attach a copy of the order of bank transfer, and
5. Mail to Prof. takao ASANO (see below).
Participant:
_Mr. _ Ms. Family name ________________________________________
Given Name(s)________________________________________
Mailing Address:
_Office _Home
Affiliation____________________________________________________
____________________________________________________
Address Street_____________________________________________
City_______________________________________________
Postal Code_____________ Country___________________
Phone___________________
Facsimile_______________
E-mail__________________
Accompanying person: if any
_Mr. _Ms. ______________________________________
Registration Fee (including social events and proceedings):
_with accomodation 40,000 yen (registered until July 5)
_with accomodation (with spouse) 70,000 yen (registered until July 5)
_without accomodation 20,000 yen (registered until July 5)
_without accomodation 25,000 yen (registered on and after
July 6)
Arrival/Departure:
Arrival Date_____________________ Time ____________________
Departure Date_____________________ Time ____________________
I remitted the above amount _______yen on ________________(date) through
_____________________________________(name of bank) to the account of
SIG-SA, representative Katsuhiro Nakamura, A/C No. 5232297 (ordinary
deposit), Miyamaedaira Branch (No. 244), Mitsui Bank and am attaching
hereto a copy of the order.
Date:___________________ Signature:_________________________________
Note: All payments must be made in Japanese Yen. Personal checks, bank
draft, traveller's checks, and credit cards are not acceptable. this
application will become valid upon receipt of confirmation from the
Conference Office. Since we can afford only a limited number of rooms
for accomodation, please registrate at your earliest convenience.
Mail this form form:
------------------------------------------
| Prof. Takao ASANO |
| Department of Mechanical Engineering |
| Sophia University |
| Kioicho 7-1, Chiyoda-ku, Tokyo 102 |
| Japan |
------------------------------------------
A brochure including several maps is available. For the brochure,
please write to or send e-mail to Prof. Takao ASANO, Local Arrangement
Co-chair of the symposium.
---------------------------------------------
| E-MAIL: t_asano@hoffman.cc.sophia.ac.jp |
---------------------------------------------
=================================================================
| SIGAL International Symposium on Algorithms |
| |
| August 16 - 18, 1990, Tokyo |
| |
| PROGRAM |
=================================================================
Thursday, August 16
9:15 Opening of the Symposium
Session I-1: Invited Talk
9:30 Recent Progress in String Algorithms
Z. Galil (Columbia Univ. and Tel Aviv Univ.)
10:30 Break (10 minutes)
Session I-2: Invited Talk
10:40 Selection Networks
N. Pippenger (Univ. of British Columbia)
11:40 LUNCH (90 minutes)
Session A-1
1:10 Computing Edge-Connectivity in Multiple and Capacitated Graphs,
H. Nagamochi and T. Ibaraki (Kyoto Univ.)
1:40 Efficient Sequential and Parallel Algorithms for Planar Minimum
Cost Flow, H. Imai (Univ. of Tokyo) and K. Iwano (IBM Res.,
Tokyo Research Lab.)
Session B-1
1:10 Structural Analysis on the Complexity of Inverting Function,
O. Watanabe (Tokyo Inst. of Technology) and S. Toda (Univ. of
Electro-Communications)
1:40 Oracles versus Proof Techniques That Do Not Relativize*,
E. Allender (Rutgers Univ.)
2:10 Break (20 minutes)
Session A-2
2:30 20-Relative Neighborhood Graphs Are Hamiltonian*, M.S. Chang
(National Chung Cheng Univ.), C.Y. Tang and R.C.T. Lee (National
Tsing Hua Univ.)
3:00 The K-Gabriel Graphs and Their Applications, T.-H. Su (National
Chia Tung Univ.), and R.-C. Chang (National Chia Tung Univ.)
Session B-2
2:30 Parallel Algorithms for Generating Subsets and Set Partitions,
B. Djoki\'{c} (Univ. of Miami), M. Miyakawa, S. Sekiguchi
(Electrotechnical Lab.), I. Semba (Ibaraki Univ.)
and I. Stojmenovi\'{c} (Univ. of Ottawa)
3:00 Parallel Algorithms for Linked List and Beyond*, Y. Han
(Univ. of Kentucky)
3:30} Break (20 minutes)
Session A-3
3:50 Local Tournaments and Recognition of Proper Circular Arc Graphs*,
J. Bang-Jensen (Univ. of Copenhagen), P. Hell and J. Huang
(Simon Fraser Univ.)
4:20 Fast Algorithms for the Dominating Set Problem on Permutation
Graphs, K.-H. Tsai and W.-L. Hsu (Northwestern Univ. and
Academia Sinica)
Session B-3
3:50 Two Probabilistic Results on Merging, W. F. de la Vega (Univ.
Paris-Sud), S. Kannan (Univ. of California, Berkeley) and
M. Santha (Univ. Paris-Sud)
4:20 Randomized Broadcast in Networks, U. Feige , D. Peleg (Weizmann
Inst. of Science), P. Raghavan (IBM T.J. Watson Res. Ctr.)
and E. Upfal (IBM Almaden Res. Ctr.)
6:00 Banquet
---------------------------------------------------------------------
Friday, August 17
Session I-3: Invited Talk
9:30 On the Construction of Abstract Voronoi Diagrams, II
R. Klein (Univ.-GHS-Essen), K. Mehlhorn and S. Meiser
(Univ. des Saarlandes)
10:30 Break (10 minutes)
Session I-4: Invited Talk
10:40 Searching in Higher Dimension
B. Chazelle (Princeton Univ.)
11:40 LUNCH (90 minutes)
Session A-4
1:10 Finding Extrema with Unary Predicates*,
D. Kirkpatrick and F. Gao (Univ. of British Columbia)
1:40 Implicitly Searching Convolutions and Computing Depth of
Collision*, D. Dobkin (Princeton Univ.), J. Hershberger
(DEC SRC), D. Kirkpatrick (Univ. of British Columbia)
and S. Suri (Bellcore)
Session B-4
1:10 Characterization for a Family of Infinitely Many Irreducible
Equally Spaced Polynomials, T. Itoh (Tokyo Inst. of Technology)\\[2mm]
1:40 Distributed Algorithms for Deciphering, M. Cosnard and J.-L.
Philippe (Ecole Normale Sup\'{e}rieure de Lyon)
2:10 Break (20 minutes)
Session A-5
2:30 An Efficient Algorithm for Optimal Loop Parallelization,
K. Iwano and S. Yeh (IBM Res., Tokyo Research Lab.)
3:00 Another View on the SSS* Algorithm, W. Pijls and A. de Bruin
(Erasmus Univ. Rotterdam)
Session B-5
2:30 Algorithms from Complexity Theory: Polynomial-Time Operations for
Complex Sets*, L. A. Hemachandra (Univ. of Rochester)
3:00 Complexity Cores and Hard Problem Instances*,
U. Sch\"{o}ning (Univ. Ulm)
3:30 Break (20 minutes)
Session A-6
3:50 Spatial Point Location and Its Applications, X.-H. Tan,
T. Hirata and Y. Inagaki (Nagoya Univ.)
4:20 Sublinear Merging and Natural Merge Sort, S. Carlsson,
C. Levcopoulos and O. Petersson (Lund Univ.)
4:50 Constructing Strongly Convex Approximate Hulls with Inaccurate
Primitives, L. J. Guibas (MIT and DEC SRC),
D. Salesin (Stanford Univ.) and J. Stolfi (DEC SRC)
Session B-6
3:50 Computing Puiseux-Series Solutions to Determinantal Equations
via Combinatorial Relaxation, K. Murota (Univ. of Tokyo)
4:20 Complexity of Probabilistic Versus Deterministic Automata*,
R. Freivalds (Latvian State Univ.)
4:50 A Tight Lower Bound on the Size of Planar Permutation Networks*,
M. Klawe (Univ. of British Columbia) and T. Leighton (MIT)
Saturday, August 18
Session I-5: Invited Talk
9:30 Simultaneous Solution of Families of Problems
R. Hassin (Tel Aviv Univ.)
10:30 Break (10 minutes)
Session A-7
10:40 Algorithms for Projecting Points to Give the Most Uniform
Distribution with Applications to Hashing, Te. Asano (Osaka
Electro-Communication Univ.) and T. Tokuyama (IBM Res., Tokyo
Research Lab.)
11:10 Topological Sweeping in Three Dimensions, E.G. Anagnostou
(Univ. of Toronto), L.J. Guibas (MIT and Cambridge Research Lab.)
and V. Polimenis (Univ. of California, Berkeley)
Session B-7
10:40 Finding Least-Weight Subsequence with Few Processors,
K.-F. Chan and T.-W. Lam (Univ. of Hong Kong)
11:10 Derandomization by Exploiting Redundancy and Mutual Independence,
Y. Han (Univ. of Kentucky) and Y. Igarashi (Gunma Univ.)
11:40 LUNCH (90 minutes)
Session A-8
1:10 Planar Separators and the Euclidean Norm, H. Gazit (Duke
University) and G. Miller (Carnegie Mellon Univ. and Univ.
of Southern California)
1:40 On the Complexity of Isometric Embedding in the Hypercube,
D. Avis (McGill Univ.)
Session B-8
1:10 Distributed Function Evaluation in the Presence of Transmission
Faults, N. Santoro (Carleton Univ. and Univ. di Bari), and
P. Widmayer (Freiburg Univ.)
1:40 Optimal Linear Broadcast, S. Bitan and S. Zaks (Technion)
2:10 Break (20 minutes)
Session A-9
2:30 Graph Augmentation Problems for a Specified Set of Vertices,
T. Watanabe, Y. Higashi and A. Nakamura (Hiroshima Univ.)
3:00 A Heuristic for the k-Center Problem with Vertex Weight,
Q. Wang and K.H. Cheng (Univ. of Houston)
Session B-9
2:30 Parallel Convexity Algorithms for Digitized Images on a Linear
Array of Processors, H. M. Alnuweiri (King Fahd Univ. of Petroleum
and Minerals) and V.K. Prasan Kumar (Univ. of Southern California)
3:00 Parallel Algorithms for Labeling Image Components,
W.-J. Hsu and X. Lin (Michigan State Univ.)
3:30 Break (20 minutes)
Session A-10
3:50 A Hyperplane Incidence Problem with Applications to Counting
Distances, H. Edelsbrunner (Univ. of Illinois) and M. Sharir
(New York Univ. and Tel Aviv Univ.)
4:20 Splitting a Configuration in a Simplex, K. Numata (Univ. of
Electro-Communications Univ.) and T. Tokuyama (IBM Res., Tokyo
Research Labs)
4:50 Weaving Patterns of Lines and Line Segments in Space, J. Pach
(New York Univ. and Hungary Academy of Sciences), R. Pollack
(New York Univ.) and E. Welzl (Freie Univ. Berlin)
Session B10
3:50 Efficient Parallel Algorithms for Path Problems in Planar Directed
Graphs, A. Lingas (Lund Univ.)
4:20 Parallel Algorithms for Finding Steiner Forests in Planar Graphs,
H. Suzuki, C. Yamanaka and T. Nishizeki (Tohoku Univ.)
4:50 Optimally Managing the History of an Evolving Forest, V. J. Tsotras
(Columbia Univ.), B. Gopinath (Rutgers Univ.) and G. W. Hart
(Columbia Univ.)
*invited papers
∂15-Jun-90 0735 @Sunburn.Stanford.EDU:gio@earth.stanford.edu Re: Martha Pollack
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 07:35:52 PDT
Received: from Earth.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07094; Fri, 15 Jun 90 07:36:54 -0700
Received: by earth.stanford.edu (4.0/inc-1.0)
id AA04963; Fri, 15 Jun 90 07:38:04 PDT
Date: Fri, 15 Jun 1990 7:38:03 PDT
From: Gio Wiederhold <gio@earth.Stanford.EDU>
To: Edward A. Feigenbaum <eaf@sumex-aim.Stanford.EDU>
Cc: Nils Nilsson <nilsson@tenaya.stanford.edu>, ac@cs.stanford.edu
Subject: Re: Martha Pollack
In-Reply-To: Your message of Fri, 15 Jun 1990 7:07:58 PDT
Message-Id: <CMM.0.88.645460683.gio@earth.stanford.edu>
Martha Pollack seems to contributing to the department that a positive vote
is warranted.
Gio
∂15-Jun-90 0755 @Sunburn.Stanford.EDU:pratt@coraki.stanford.edu consulting professors
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 07:54:57 PDT
Received: from Coraki.Stanford.EDU by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA07374; Fri, 15 Jun 90 07:56:02 -0700
Received: by coraki.stanford.edu (4.0/25-eef) id AA27825; Fri, 15 Jun 90 07:56:02 PDT
Date: Fri, 15 Jun 90 07:56:02 PDT
From: Vaughan Pratt <pratt@cs.Stanford.EDU>
Message-Id: <9006151456.AA27825@coraki.stanford.edu>
To: ac@cs.Stanford.EDU
Subject: consulting professors
From: Edward A. Feigenbaum <eaf@sumex-aim.Stanford.EDU>
let me just remark (reflect) that our standard for Consulting
Professor has NEVER been that the person had to be of the
quality that could be appointed to the regular faculty. The
criterion has always been: outstanding scientist IN INDUSTRY
who devoted about one day per week to helping us with teaching,
thesis supervision, or research (in return for which we "paid"
the person with a Consulting Professor title).
This is all news to me. Not to comment specifically on Martha's
situation, but just for general interest and future such situations,
I'd like to know the status of this. When the CSLI appointments were
first proposed I distinctly recall that one of the criteria applied was
whether the candidates were of faculty quality. This criterion was
also brought up for each of the subsequent candidates for consulting
professor.
I also don't remember anything about a requirement that they be in
industry. For example when Forest Baskett left and went into industry,
if instead he had simply decided to stay at home and help out a day per
week would he then not be eligible to be a consulting professor? Or in
that case would we have then made him a Professor Emeritus?
Ordinarily these questions about criteria are resolved by writing
the criteria down when they are formulated. Perhaps we are victims of
the paperless office revolution.
-v
∂15-Jun-90 0914 keyes@sierra.Stanford.EDU Faculty Mtg
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 09:14:12 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Fri, 15 Jun 90 09:12:29 PDT
Date: Fri, 15 Jun 90 09:12:29 PDT
From: keyes@sierra.Stanford.EDU (Gloria L. Keyes)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: keyes@sierra.Stanford.EDU
Subject: Faculty Mtg
Message-Id: <CMM.0.88.645466348.keyes@>
Just a reminder that there is a faculty meeting today, Friday, at 11:00
in McC 240 to vote on degree conferral.
∂15-Jun-90 0949 damon@Sunburn.Stanford.EDU Dr. McCarthy's Mail
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 09:49:19 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA10266; Fri, 15 Jun 90 09:50:25 -0700
Date: Fri, 15 Jun 1990 9:50:24 PDT
From: Damon Koronakos <damon@Sunburn.Stanford.EDU>
To: jmc@cs.Stanford.EDU, me@cs.Stanford.EDU
Subject: Dr. McCarthy's Mail
Message-Id: <CMM.0.88.645468624.damon@Sunburn.Stanford.EDU>
Hi folks,
DATABASE-MAINTAINED LISTS
-----------------------------------------------------------------------------
I resisted creating a new "fake" person (e.g. John McCarthy 2). People
would see two John McCarthy entries in LOOKUP and PEDIT, and wouldn't
know which to use (so personal/list mail would still get misdirected).
Also, many reports are generated from the database, and depend on the
presence or absence of relations, etc. If only one of the McCarthy
entries (the "jmc-lists" one) had the correct relations, this would confuse
people further (so lots of personal mail would probably go to "jmc-lists").
So I just hacked the program that generates mailing lists. If it sees
a person with last name "McCarthy" and pedit email "jmc", it will
replace "jmc" with "jmc-lists" and leave the host name unchanged.
I changed Jmc's pedit entry to route mail to "jmc@sail". Thus all the
automatically-generated lists will send to "jmc-lists@sail". If Jmc's
mail ever moves from sail, just make sure there is a "jmc" entry and
a "jmc-lists" entry on that machine, and change the pedit email to
read "jmc@<wherever>".
HUMAN-MAINTAINED LISTS
-----------------------------------------------------------------------------
There are lots of other mailing lists which are maintained by various staff
people (e.g. Joyce Chandler includes Jmc on "phd admissions committee",
"tenured faculty", "retreat attendees 1990", etc.), rather than generated
automatically from the database.
The people who maintain these lists do so through the MEDIT utility. MEDIT
uses your cs-alias (e.g. "jmc@cs") by default when building a list, but this
can be easily overridden (to "jmc-lists@sail" in this case).
If a person enters jmc@cs into a MEDIT mailing list, you'll get "list" mail
at your "personal" address. If this happens, send me email and I'll fix
these problems as they arise.
Hope this helps,
Damon
∂15-Jun-90 0954 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU FOCS90 list
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 09:51:43 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA22926; Fri, 15 Jun 90 09:36:16 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA05426; Fri, 15 Jun 90 09:38:34 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA09880; Fri, 15 Jun 90 09:32:52 -0700
Message-Id: <9006151632.AA09880@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 2743; Fri, 15 Jun 90 08:54:01 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
2701; Fri, 15 Jun 90 08:51:41 CDT
Date: Fri, 15 Jun 90 09:45:36 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
mihalis@research.att.com
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: mihalis%research.att.com@VM1.NoDak.EDU
Subject: FOCS90 list
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
List of accepted papers for FOCS90
Siu Wing Cheng, Ravi Janardan
New Results on Dynamic Planar Point Location
Andras Frank
Augmenting Graphs to Meet Edge-Connectivity Requirements
Xiaotie Deng, Christos H. Papadimitriou
Exploring an Unknown Graph
Laszlo Lovasz, Miklos Simonovits
The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the
Volume
Antoni Koscielski, Leszek Pacholski
Complexity of Unification in Free Groups and Free Semi-groups
Adi Shamir
IP=PSPACE
Uriel Feige, Drop Lapidot, Adi Shamir
Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String
Jehoshua Bruck, Roman Smolensky
Polynomial Threshold Functions, $AC sup 0$ Functions and Spectral Norms
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack,
Raimund Seidel, Micha Sharir, Jack Snoeyink
Counting and Cutting Cycles of Lines and Rods in Space
Christos H. Papadimitriou
On Graph-theoretic Lemmata and Complexity Classes
James F. Lynch
Probabilities of Sentences about Very Sparse Random Graphs
Wolfgang Maass, Gyorgy Turan
On the Complexity of Learning from Counterexamples and Membership Queries
Noga Alon, Moni Naor
Coin-flipping games immune against linear-sized coalitions
Moshe Dubiner, Zvi Galil, Edith Magen
Faster Tree Pattern Matching
Livio Colussi, Zvi Galil, Raffaele Giancarlo
On the Exact Complexity of String Matching
Noga Alon, Nimrod Megiddo
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
Bernard Chazelle
Efficient Polygon Triangulation
Michael S. Paterson, Nicholas Pippenger, Uri Zwick
Faster Circuits and Shorter Formulae for multiple addition, multiplication and
symmetric Boolean functions
Mark A. Fulk
Robust Separations in Inductive Inference
Karl Abrahamson
A Time Space Tradeoffs for Boolean Matrix Multiplication
Michael Kaminski, Nissin Francez
Finite-Memory Automata
Seinosuke Toda
The Complexity of Finding Medians
Carl Sturtivant, Zhi-Li Zhang
Efficiently Inverting Bijections Given by Straight Line Programs
Mark de Berg, Mark H. Overmars
Hidden surface removal for axis-parallel polyhedra
Jens Lagergren
Efficient Parallel Algorithms for Tree-Decomposition and Related Problems
Brigitte Vallee, Philippe Flajolet
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
Roman Smolensky
On interpolation by analytic functions with special properties and some weak
lower bounds on the size of circuits with symmetric gates
Richard Cole, Arvind Raghunathan
Online Algorithms for Finger Searching
Pravin M. Vaidya
Reducing the parallel complexity of certain linear programming problems
Dana Angluin, Michael Frazier, Leonard Pitt
Learning Conjunctions of Horn Clauses
David Aldous, Umesh Vazirani
A Markovian Extension of Valiant's Learning
Sandy Irani
Coloring Inductive Graphs On-line
David Zuckerman
General Weak Random Sources
C. Andrew Neff
Specified Precision Polynomial Root Isolation is in NC
Charles Martel, Ramesh Subramonian, Arvin Park
Asynchronous PRAMs are (almost) as good as Synchronous PRAMs
Yuri Gurevich
Matrix Decomposition Problem is Complete for the Average Case
Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
Time-Space Tradeoffs for Undirected Graph Traversal
Paul Bay, Gianfranco Bilardi
Deterministic On-Line Routing on Area-Universal Networks
David Harel, Danny Raz
Deciding Properties of Nonregular Programs
Marshall Bern, David Eppstein, John Gilbert
Provably Good Mesh Generation
Paul Beame, Martin Tompa, Peiyuan Yan
Communication-Space Tradeoffs for Unrestricted Protocols
Gwoboa Horng, Ming-Deh A. Huang
Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth
Dalit Naor, D. Gusfield, C. Martel
A Fast Algorithm for Optimally Increasing the Edge-Connectivity
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
In-Place Rearrangement of Data
M. Formann, T. Hagerup, J. Haralambides, F. T. Leighton, A. Simvonis, E. Welzl,
G. Woeginger
Drawing Graphs in the Plane With High Resolution
S. Rao Kosaraju, Arthur L. Delcher
A Tree-Partitioning Technique With Applications to Expression Evaluation and
Term Matching
Ding-Zhu Du, F. K. Hwang
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak Conjecture on
Steiner Ratio
Bowen Alpern, Larry Carter, Ephraim Feig
Uniform Memory Hierarchies
Arkady Kanevsky
Reliability of Distributed Networks via Network Decomposition
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
On the predictabilty of coupled automata: an allegory about chaos
Sampath Kannan, Tandy J. Warnow
Inferring Evolutionary History from DNA Sequences
Ming Li
Towards a DNA sequencing theory
William I. Chang, Eugene L. Lawler
Approximate String Matching in Sublinear Expected Time
Baruch Awerbuch, Israel Cidon, Shay Kutten
Optimal Maintenance of Replicated Information
Michael L. Fredman, Dan E. Willard
Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths
John H. Reif, J. D. Tygar, Akitoshi Yoshida
The Computability and Complexity of Optical Beam Tracing
Patrick D. Lincoln, John Mitchell, Andre Scedrov, Natarajan Shankar
Decision Problems for Propositional Linear Logic
Andrew Chi-Chih Yao
On ACC and Threshold Circuits
Ramamohan Paturi, Michael E. Saks
On Threshold Circuits for Parity
Zhi-Quan Luo, John N. Tsitsiklis
Communication Complexity of Algebraic Computation
Shay Assaf, Eli Upfal
Fault Tolerant Sorting Network
Ran Canetti, Oded Goldreich
Bounds on Tradeoffs between Randomness and Communication Complexity
Oded Goldreich, Johan Hastad
A Simple Construction of Almost k-wise Independent Random Variables
Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan,
David Zuckerman
Security Preserving Amplification of Hardness
Benny Chor, Mihaly Gereb-Graus, Eyal Kushilevitz
Private Computations Over the Integers
C. Lund, L. Fortnow, H. Karloff, N. Nisan
Algebraic Methods for Interactive Proof Systems
L. Babai, L. Fortnow
A Characterization of #P by Straight Line Programs of Polynomials
L. Babai, L. Fortnow, C. Lund
Non-Deterministic Exponential Time has Two-Prover Interactive Protocols
L. Babai, G. Hetyei, W. Kantor, A. Lubotzky, A. Seress
On the Diameter of Finite Groups
S. Vishwanathan
Randomized Online Coloring of Graphs
Shimon Even, Ami Litman, Peter Winkler
Computing with Snakes in Directed Networks of Automata
Amos Fiat, Yuval Rabani, Yiftach Ravid
Competitive k-Server Algorithms
Baruch Awerbuch, David Peleg
Network synchronization with polylogarithmic overhead
Avrim Blum
Separating PAC and Mistake-Bound Learning Models over the Boolean Domain
Russell Impagliazzo, Leonid A. Levin
No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random
Baruch Awerbuch, Michael Saks
A Dining Philosophers algorithm with polynomial response time
Baruch Awerbuch, David Peleg
Sparse Partitions
P. Klein, Ajit Agrawal, Ravi Ramamurthy, S. Rao
Approximation through multicommodity flow
Tom Leighton, C. Greg Plaxton
A (fairly) Simple Circuit that (usually) Sorts
C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, G. Nelson, P.
Raghavan, S. Rao, C. Thomborson, A. Tsantilas
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors
Mihir Bellare, Shafi Goldwasser, John Rompel
Randomness in Interactive Proofs
Hagit Attiya, Nancy Lynch, Nir Shavit
Are Wait-Free Algorithms Fast?
Avrim Blum
Some Tools for Approximate 3-Coloring
Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
Exact Identification of Circuits Using Fixed Points of Amplification Functions
Michael J. Kearns, Robert E. Schapire
Efficient Distribution-free Learning of Probabilistic Concepts
Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
Perfectly Secure Message Transmission
Omer Berkman, Joseph JaJa, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi
Vishkin
Some Triply-Logarithmic Parallel Algorithms
Johan Hastad, Mikael Goldman
On the Power of Small-Depth Threshold Circuits
Dima Yu. Grigoriev, Marek Karpinski, Michael F. Singer
Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents
Oded Maler, Amir Pnueli
Tight Bounds on the Complexity of Cascaded Decomposition of Automata
Amir Pnueli, Roni Rosner
Distributed Reactive Systems are Hard to Synthesize
Sorin Istrail
Constructing Polynomial Universal Traversing Sequences for Graphs with Small
Diameter
∂15-Jun-90 1017 marx@sierra.Stanford.EDU Outstanding Service Award for Graduate Student
Received: from sierra.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 10:17:16 PDT
Received: by sierra.Stanford.EDU (4.0/4.7); Fri, 15 Jun 90 10:12:59 PDT
Date: Fri, 15 Jun 90 10:12:59 PDT
From: marx@sierra.Stanford.EDU (Marianne L. Marx)
To: ee-faculty@sierra, ee-adminlist@sierra
Cc: marx@sierra.Stanford.EDU
Subject: Outstanding Service Award for Graduate Student
Message-Id: <CMM.0.88.645469978.marx@>
Thank you very much for nominations of students you felt were deserving of the
Outstanding Service Award for a Graduate Student. We had some excellent
nominations and the choice was difficult. We did however reach a decision and
the award will go to Tasha Castaneda for her contributions as Ambassador from
Electrical Engineering to the University at large, mentor to other graduate
women in EE, and representative from the department to prospective women and
minority students.
We appreciate your input. Hope to see you at Commencement Sunday.
Regards,
Marianne
∂15-Jun-90 1153 stager@Sunburn.Stanford.EDU Department Commencement Ceremony
Received: from Sunburn.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 11:53:13 PDT
Received: by Sunburn.Stanford.EDU (5.61+IDA/25-eef) id AA14281; Fri, 15 Jun 90 11:53:44 -0700
Date: Fri, 15 Jun 1990 11:53:43 PDT
From: "Claire E. Stager" <stager@Sunburn.Stanford.EDU>
To: faculty@Sunburn.Stanford.EDU
Subject: Department Commencement Ceremony
Message-Id: <CMM.0.88.645476023.stager@Sunburn.Stanford.EDU>
I'm still hearing that no one knows when and where the department
commencement ceremony will be held, so here's one more message:
Our CS ceremony will be held in the Old Union Courtyard (this Sunday the
17th), and should get started no later than 12:30. The ceremony generally
runs for less that an hour.
We'd love to see you there!
Claire
∂15-Jun-90 1515 @Theory.Stanford.EDU,@Neon.Stanford.EDU,@Sunburn.Stanford.EDU:THEORYNT@VM1.NoDak.EDU FOCS90 authors (sorted)
Received: from Theory.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 15:11:53 PDT
Received: from Neon.Stanford.EDU by Theory.Stanford.EDU with SMTP (5.61/25-theory-eef) id AA23275; Fri, 15 Jun 90 14:56:27 -0700
Received: from Sunburn.Stanford.EDU by Neon.Stanford.EDU with SMTP (5.61/25-eef) id AA26204; Fri, 15 Jun 90 14:58:46 -0700
Received: from vm1.NoDak.edu by Sunburn.Stanford.EDU with SMTP (5.61+IDA/25-eef) id AA19288; Fri, 15 Jun 90 14:58:01 -0700
Message-Id: <9006152158.AA19288@Sunburn.Stanford.EDU>
Received: from NDSUVM1.BITNET by VM1.NoDak.EDU (IBM VM SMTP R1.2.1MX) with BSMTP id 4961; Fri, 15 Jun 90 16:22:16 CDT
Received: from NDSUVM1.BITNET by NDSUVM1.BITNET (Mailer R2.07) with BSMTP id
4946; Fri, 15 Jun 90 16:22:13 CDT
Date: Fri, 15 Jun 90 17:14:48 -0400
Reply-To: Theory-A - TheoryNet World-Wide Events <THEORY-A@VM1.NoDak.EDU>,
Vaughan Pratt <pratt@cs.Stanford.EDU>
Sender: TheoryNet List <THEORYNT@VM1.NoDak.EDU>
Comments: To: Theory-A@vm1.nodak.edu
Comments: Warning -- original Sender: tag was THEORY-A@NDSUVM1
From: Vaughan Pratt <pratt%cs.stanford.edu@VM1.NoDak.EDU>
Subject: FOCS90 authors (sorted)
To: Multiple recipients of list THEORYNT <THEORYNT@NDSUVM1>
Here are the authors from Mihalis' list. By my count (not double
checked) there are 187 authors of 92 papers, or 221 if you count the
the 21 doubly-papered authors twice, the 5 triply-papered authors
thrice and the one quadruply-papered author four times. That's more
authors than some conferences have attendees!
Karl Abrahamson Ajit Agrawal David Aldous Noga Alon(2) Bowen Alpern
Dana Angluin Shay Assaf Hagit Attiya Baruch Awerbuch(4) L. Babai(3)
Paul Bay Paul Beame(2) Mihir Bellare Omer Berkman Marshall Bern
G. Bilardi Avrim Blum(2) Allan Borodin Jehoshua Bruck Sam Buss
Ran Canetti Larry Carter William Chang B. Chazelle(2) Siu-Wing Cheng
Benny Chor Israel Cidon Richard Cole Livio Colussi Mark DeBerg
Arthur Delcher Xiaotie Deng Danny Dolev Ding-Zhu Du Moshe Dubiner
Cynthia Dwork H. Edelsbrunner David Eppstein Shimon Even Ephraim Feig
Uriel Feige Amos Fiat Faith Fich P. Flajolet M. Formann
L. Fortnow(3) Nissim Francez Andras Frank Michael Frazier Michael Fredman
Mark Fulk Zvi Galil(2) M. Gereb-Graus R. Giancarlo John Gilbert
Mikael Goldman Sally Goldman O. Goldreich(3) S. Goldwasser Dima Grigoriev
Leonidas Guibas Yuri Gurevich D. Gusfield T. Hagerup J. Haralambides
David Harel Johan Hastad(2) G. Hetyei Gwoboa Horng Ming-Deh Huang
K. Hwang R. Impagliazzo(2) Sandy Irani Sorin Istrail Joseph JaJa
Ravi Janardan C. Kaklamanis M. Kaminski Arkady Kanevsky Sampath Kannan
W. Kantor A. Karlin H. Karloff Marek Karpinski M. Kearns(2)
P. Klein Rao Kosaraju A. Koscielski S. Krishnamurthy E. Kushilevitz
Shay Kutten Jens Lagergren Drop Lapidot Eugene Lawler Tom Leighton(3)
Leonid Levin(2) Ming Li Patrick Lincoln Ami Litman Laszlo Lovasz
A. Lubotzky C. Lund(2) Zhi-Quan Luo James Lynch Nancy Lynch
Wolfgang Maass Edith Magen Oded Maler C. Martel Charles Martel
Nimrod Megiddo V. Milenkovic John Mitchell Ian Munro Dalit Naor
Moni Naor Andrew Neff G. Nelson N. Nisan Mark Overmars
L. Pacholski C. Papadimitriou(3) Arvin Park M. Paterson Ramamohan Paturi
David Peleg(2) N. Pippenger Leonard Pitt Greg Plaxton Amir Pnueli(2)
P. Poblete Richard Pollack Yuval Rabani P. Raghavan(2)
A. Raghunathan Ravi Ramamurthy S. Rao(2) Yiftach Ravid Danny Raz
John Reif John Rompel Roni Rosner Walter Ruzzo Michael Saks(2)
Andre Scedrov R. Schapire(2) Raimund Seidel A. Seress Adi Shamir(2)
N. Shankar Micha Sharir Nir Shavit M. Simonovits A. Simvonis
Michael Singer R. Smolensky(2) Jack Snoeyink Carl Sturtivant R. Subramonian
C. Thomborson R. Thurimella Seinosuke Toda Martin Tompa(2) A. Tsantilas
J. Tsitsiklis(2)Gyorgy Turan D. Tygar Eli Upfal Pravin Vaidya
Brigitte Vallee Umesh Vazirani R. Venkatesan Uzi Vishkin S. Vishwanathan
Orli Waarts Tandy Warnow E. Welzl Dan Willard Peter Winkler
G. Woeginger Peiyuan Yan Andrew Yao A. Yoshida Moti Yung
Zhi-Li Zhang David Zuckerman(2) Uri Zwick
∂15-Jun-90 1516 ingrid@russell.Stanford.EDU NEW VISITOR
Received: from russell.Stanford.EDU by SAIL.Stanford.EDU with TCP; 15 Jun 90 15:16:21 PDT
Received: by russell.Stanford.EDU (4.1/inc-1.0)
id AA25762; Fri, 15 Jun 90 14:51:44 PDT
Date: Fri, 15 Jun 90 14:51:44 PDT
From: ingrid@russell.Stanford.EDU (Ingrid Deiwiks)
Message-Id: <9006152151.AA25762@russell.Stanford.EDU>
To: friends@russell.Stanford.EDU
Subject: NEW VISITOR
NEW CSLI/XEROX PARC VISITOR
Prashant Parikh, Computer Science Group, Tata Institute of Fundamental
Research, India. During his stay at CSLI and Xerox PARC, Prashant
will continue his work on situated communication within the frameworks
of situation theory and game theory. In particular, he will work on a
book based on his dissertation. He will also explore other related
topics involving situation theory, situated agency, and applications
to natural-language semantics. Prashant's email address is
parikh@csli, and he will visit from June through September 1990.
∂16-Jun-90 0608 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM My Weekly Weirdo (part 2a)
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 16 Jun 90 06:08:43 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 525131; 16 Jun 90 09:06:52 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 126933; Sat 16-Jun-90 06:00:29 PDT
Date: Sat, 16 Jun 90 06:00 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: My Weekly Weirdo (part 2a)
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900616130019.2.RWG@TSUNAMI.SPA.Symbolics.COM>
Putting a = i f cot f, then f = pi/6 in yesterday's weirdo,
_______________
inf 1 / 1 5 sqrt(3) pi
==== (n + -) cos(pi _ / (n + -) (n + -) ) - ----------
\ 2 \/ 6 6 2 6
> ------------------------------------- = pi e
/ n 1 2 2 2
==== (-) (n + -) (n + -)
n = 0 3 3
= 3.9850907687316903d0
The convergence is O(n↑-4), since the geometric mean
of n+1/6 and n+5/6 approaches n+1/2, so that
cos()/(-)↑n = pi/(18(n+1/2)) + O((n+1/2)↑-3).
(Part 3 will have a (-)↑binom(n,2).)
∂16-Jun-90 0636 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM good tidings to you
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 16 Jun 90 06:36:32 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 525134; 16 Jun 90 09:35:48 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 126938; Sat 16-Jun-90 06:33:49 PDT
Date: Sat, 16 Jun 90 06:33 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: good tidings to you
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "hpm@rover.ri.cmu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900616133342.3.RWG@TSUNAMI.SPA.Symbolics.COM>
A body's tidal influence depends mainly on its apparent diameter, since
varying either its true diameter or its proximity varies either the mass
or the gravity gradient cubically, with equal effect on both tide and
appearance. Since the sun and moon have the same apparent diameter, and
their tidal effects are in roughly 40/60 ratio, this must also be their
density ratio, since tidal effect also scales with density.
But why does the sun have an apparent diameter? If it is a ball of
gas, why doesn't it just fade exponentially with radius, like a
planetary atmosphere, instead of having such a well defined surface?
And why, on the Atlantic seaboard at least, do the full and new moon
flood tides occur at sunrise/sunset, instead of noon/midnight, as
predicted by the ellipsoidally-bulging-oceans model?
∂17-Jun-90 0630 @ELEPHANT-BUTTE.SCRC.Symbolics.COM:rwg@RUSSIAN.SPA.Symbolics.COM My Weekly Weirdo (part 3)
Received: from ELEPHANT-BUTTE.SCRC.Symbolics.COM by SAIL.Stanford.EDU with TCP; 17 Jun 90 06:30:46 PDT
Received: from RUSSIAN.SPA.Symbolics.COM by ELEPHANT-BUTTE.SCRC.Symbolics.COM via CHAOS with CHAOS-MAIL id 525260; 17 Jun 90 09:29:00 EDT
Received: from TSUNAMI.SPA.Symbolics.COM by RUSSIAN.SPA.Symbolics.COM via CHAOS with CHAOS-MAIL id 126962; Sun 17-Jun-90 06:26:59 PDT
Date: Sun, 17 Jun 90 06:26 PDT
From: Bill Gosper <rwg@RUSSIAN.SPA.Symbolics.COM>
Subject: My Weekly Weirdo (part 3)
To: math-fun@RUSSIAN.SPA.Symbolics.COM
cc: "HUL@PSUVM.PSU.EDU"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "craig@brahms.berkeley.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"rcs@la.tis.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "amo@research.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"george@euler.math.nwu.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jdl@pruxe.att.com"@ELEPHANT-BUTTE.SCRC.Symbolics.COM,
"wilf@central.cis.upenn.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM, "jmc-lists@sail.stanford.edu"@ELEPHANT-BUTTE.SCRC.Symbolics.COM
Message-ID: <19900617132650.9.RWG@TSUNAMI.SPA.Symbolics.COM>
n+1
( ) 2
inf 2 1 2 pi 2
==== (-) cos(sqrt((n + -) --- + a )) 2
\ 2 4 pi cos a
(D2167) > -------------------------------------- = ---------
/ 1 2 2 sqrt(2)
==== (n + -)
n = 0 2
Note that, despite the (-)↑binom, the terms are all positive if, e.g.,
|a| < pi sqrt(3)/4.